./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db9df7d135a21d792e3a2ca832f85f7c7fc22de6655b2cb0ba03be5cd467b7e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:40:24,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:40:24,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:40:24,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:40:24,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:40:24,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:40:24,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:40:24,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:40:24,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:40:24,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:40:24,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:40:24,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:40:24,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:40:24,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:40:24,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:40:24,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:40:24,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:40:24,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:40:24,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:40:24,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:40:24,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:40:24,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:40:24,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:40:24,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:40:24,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:40:24,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:40:24,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:40:24,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:40:24,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:40:24,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:40:24,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:40:24,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:40:24,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:40:24,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:40:24,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db9df7d135a21d792e3a2ca832f85f7c7fc22de6655b2cb0ba03be5cd467b7e3 [2025-03-03 15:40:24,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:40:24,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:40:24,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:40:24,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:40:24,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:40:24,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c [2025-03-03 15:40:25,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bf674d3b/de0e045c941a49e08f8e611043532ff2/FLAG64ebecec6 [2025-03-03 15:40:26,275 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:40:26,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c [2025-03-03 15:40:26,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bf674d3b/de0e045c941a49e08f8e611043532ff2/FLAG64ebecec6 [2025-03-03 15:40:26,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bf674d3b/de0e045c941a49e08f8e611043532ff2 [2025-03-03 15:40:26,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:40:26,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:40:26,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:40:26,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:40:26,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:40:26,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:40:26" (1/1) ... [2025-03-03 15:40:26,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389ec853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:26, skipping insertion in model container [2025-03-03 15:40:26,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:40:26" (1/1) ... [2025-03-03 15:40:26,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:40:27,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c[381679,381692] [2025-03-03 15:40:27,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c[383339,383352] [2025-03-03 15:40:27,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:40:27,733 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:40:28,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c[381679,381692] [2025-03-03 15:40:28,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c[383339,383352] [2025-03-03 15:40:28,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:40:28,354 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:40:28,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28 WrapperNode [2025-03-03 15:40:28,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:40:28,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:40:28,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:40:28,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:40:28,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:28,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:28,743 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-03-03 15:40:28,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:40:28,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:40:28,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:40:28,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:40:28,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:28,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:28,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:28,856 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:40:28,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:28,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:29,046 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:29,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:29,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:29,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:29,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:40:29,225 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:40:29,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:40:29,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:40:29,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (1/1) ... [2025-03-03 15:40:29,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:40:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:29,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:40:29,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:40:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:40:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:40:29,313 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:40:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:40:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:40:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:40:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:40:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:40:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:40:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:40:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:40:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:40:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:40:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:40:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:40:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:40:29,426 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:40:29,427 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:40:35,121 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:40:35,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:40:35,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:40:35,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:40:35,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:40:35,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:40:35,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:40:35,308 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-03-03 15:40:35,309 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:40:35,348 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:40:35,349 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:40:35,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:40:35 BoogieIcfgContainer [2025-03-03 15:40:35,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:40:35,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:40:35,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:40:35,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:40:35,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:40:26" (1/3) ... [2025-03-03 15:40:35,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46499357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:40:35, skipping insertion in model container [2025-03-03 15:40:35,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:28" (2/3) ... [2025-03-03 15:40:35,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46499357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:40:35, skipping insertion in model container [2025-03-03 15:40:35,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:40:35" (3/3) ... [2025-03-03 15:40:35,357 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.08.cil-1.c [2025-03-03 15:40:35,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:40:35,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.08.cil-1.c that has 7 procedures, 2483 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-03 15:40:35,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:40:35,472 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;@2cae7725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:40:35,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:40:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 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-03 15:40:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:35,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:35,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:35,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:35,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash 840339491, now seen corresponding path program 1 times [2025-03-03 15:40:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:35,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663111495] [2025-03-03 15:40:35,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:35,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:35,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:35,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:35,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:36,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:36,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663111495] [2025-03-03 15:40:36,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663111495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:36,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:36,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:36,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673976743] [2025-03-03 15:40:36,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:36,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:36,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:36,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:36,082 INFO L87 Difference]: Start difference. First operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 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.8) internal successors, (124), 4 states have internal predecessors, (124), 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-03 15:40:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:36,702 INFO L93 Difference]: Finished difference Result 5264 states and 9573 transitions. [2025-03-03 15:40:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:40:36,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:36,723 INFO L225 Difference]: With dead ends: 5264 [2025-03-03 15:40:36,724 INFO L226 Difference]: Without dead ends: 2727 [2025-03-03 15:40:36,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:36,734 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4854 mSDsluCounter, 8959 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4870 SdHoareTripleChecker+Valid, 13339 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-03 15:40:36,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4870 Valid, 13339 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:40:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2025-03-03 15:40:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2706. [2025-03-03 15:40:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7997737556561086) internal successors, (4773), 2655 states have internal predecessors, (4773), 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-03 15:40:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4852 transitions. [2025-03-03 15:40:36,874 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4852 transitions. Word has length 134 [2025-03-03 15:40:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:36,874 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4852 transitions. [2025-03-03 15:40:36,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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-03 15:40:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4852 transitions. [2025-03-03 15:40:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:36,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:36,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:36,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:40:36,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -12912283, now seen corresponding path program 1 times [2025-03-03 15:40:36,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694992271] [2025-03-03 15:40:36,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:36,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:36,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:36,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:36,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694992271] [2025-03-03 15:40:37,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694992271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:37,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:37,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:37,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342218703] [2025-03-03 15:40:37,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:37,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:37,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:37,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:37,058 INFO L87 Difference]: Start difference. First operand 2706 states and 4852 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:37,322 INFO L93 Difference]: Finished difference Result 3329 states and 5825 transitions. [2025-03-03 15:40:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:37,333 INFO L225 Difference]: With dead ends: 3329 [2025-03-03 15:40:37,334 INFO L226 Difference]: Without dead ends: 2760 [2025-03-03 15:40:37,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:37,336 INFO L435 NwaCegarLoop]: 4299 mSDtfsCounter, 4553 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 12782 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-03 15:40:37,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 12782 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:40:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2025-03-03 15:40:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2706. [2025-03-03 15:40:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7990196078431373) internal successors, (4771), 2655 states have internal predecessors, (4771), 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-03 15:40:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4850 transitions. [2025-03-03 15:40:37,413 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4850 transitions. Word has length 134 [2025-03-03 15:40:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:37,413 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4850 transitions. [2025-03-03 15:40:37,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4850 transitions. [2025-03-03 15:40:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:37,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:37,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:37,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:40:37,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:37,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1159452796, now seen corresponding path program 1 times [2025-03-03 15:40:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931849285] [2025-03-03 15:40:37,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:37,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:37,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:37,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:37,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:37,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931849285] [2025-03-03 15:40:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931849285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:37,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:37,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42925162] [2025-03-03 15:40:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:37,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:37,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:37,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:37,638 INFO L87 Difference]: Start difference. First operand 2706 states and 4850 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:38,247 INFO L93 Difference]: Finished difference Result 3634 states and 6288 transitions. [2025-03-03 15:40:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:38,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:38,259 INFO L225 Difference]: With dead ends: 3634 [2025-03-03 15:40:38,259 INFO L226 Difference]: Without dead ends: 3065 [2025-03-03 15:40:38,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:40:38,263 INFO L435 NwaCegarLoop]: 4548 mSDtfsCounter, 4781 mSDsluCounter, 13683 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4797 SdHoareTripleChecker+Valid, 18231 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-03 15:40:38,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4797 Valid, 18231 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:40:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2025-03-03 15:40:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2976. [2025-03-03 15:40:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2898 states have (on average 1.7736369910282954) internal successors, (5140), 2902 states have internal predecessors, (5140), 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-03 15:40:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5256 transitions. [2025-03-03 15:40:38,342 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5256 transitions. Word has length 134 [2025-03-03 15:40:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:38,343 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5256 transitions. [2025-03-03 15:40:38,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5256 transitions. [2025-03-03 15:40:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:38,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:38,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:38,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:40:38,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:38,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:38,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1851603333, now seen corresponding path program 1 times [2025-03-03 15:40:38,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:38,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256698631] [2025-03-03 15:40:38,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:38,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:38,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:38,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:38,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256698631] [2025-03-03 15:40:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256698631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946760344] [2025-03-03 15:40:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:38,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:38,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:38,523 INFO L87 Difference]: Start difference. First operand 2976 states and 5256 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:39,140 INFO L93 Difference]: Finished difference Result 4487 states and 7591 transitions. [2025-03-03 15:40:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:39,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:39,156 INFO L225 Difference]: With dead ends: 4487 [2025-03-03 15:40:39,157 INFO L226 Difference]: Without dead ends: 3648 [2025-03-03 15:40:39,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:40:39,162 INFO L435 NwaCegarLoop]: 4544 mSDtfsCounter, 4776 mSDsluCounter, 13671 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4792 SdHoareTripleChecker+Valid, 18215 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-03 15:40:39,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4792 Valid, 18215 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:40:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2025-03-03 15:40:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3547. [2025-03-03 15:40:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3419 states have (on average 1.7353027200935947) internal successors, (5933), 3427 states have internal predecessors, (5933), 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-03 15:40:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 6129 transitions. [2025-03-03 15:40:39,267 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 6129 transitions. Word has length 134 [2025-03-03 15:40:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:39,267 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 6129 transitions. [2025-03-03 15:40:39,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 6129 transitions. [2025-03-03 15:40:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:39,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:39,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:39,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:40:39,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:39,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2087281508, now seen corresponding path program 1 times [2025-03-03 15:40:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:39,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672564991] [2025-03-03 15:40:39,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:39,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:39,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:39,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:39,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:39,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672564991] [2025-03-03 15:40:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672564991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:39,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:39,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501901381] [2025-03-03 15:40:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:39,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:39,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:39,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:39,385 INFO L87 Difference]: Start difference. First operand 3547 states and 6129 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:39,940 INFO L93 Difference]: Finished difference Result 6312 states and 10438 transitions. [2025-03-03 15:40:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:39,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:39,958 INFO L225 Difference]: With dead ends: 6312 [2025-03-03 15:40:39,958 INFO L226 Difference]: Without dead ends: 4902 [2025-03-03 15:40:39,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:40:39,964 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 4797 mSDsluCounter, 13155 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4813 SdHoareTripleChecker+Valid, 17486 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-03 15:40:39,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4813 Valid, 17486 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:40:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2025-03-03 15:40:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4776. [2025-03-03 15:40:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4542 states have (on average 1.6893439013650375) internal successors, (7673), 4564 states have internal predecessors, (7673), 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-03 15:40:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 8053 transitions. [2025-03-03 15:40:40,083 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 8053 transitions. Word has length 134 [2025-03-03 15:40:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:40,083 INFO L471 AbstractCegarLoop]: Abstraction has 4776 states and 8053 transitions. [2025-03-03 15:40:40,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 8053 transitions. [2025-03-03 15:40:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:40,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:40,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:40,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:40:40,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:40,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1263600037, now seen corresponding path program 1 times [2025-03-03 15:40:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:40,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053629040] [2025-03-03 15:40:40,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:40,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:40,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:40,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:40,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:40,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:40,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:40,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053629040] [2025-03-03 15:40:40,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053629040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:40,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:40,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:40,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373930932] [2025-03-03 15:40:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:40,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:40,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:40,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:40,245 INFO L87 Difference]: Start difference. First operand 4776 states and 8053 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:40,818 INFO L93 Difference]: Finished difference Result 10291 states and 16832 transitions. [2025-03-03 15:40:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:40,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:40,847 INFO L225 Difference]: With dead ends: 10291 [2025-03-03 15:40:40,847 INFO L226 Difference]: Without dead ends: 7652 [2025-03-03 15:40:40,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:40:40,856 INFO L435 NwaCegarLoop]: 4538 mSDtfsCounter, 4766 mSDsluCounter, 13653 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4782 SdHoareTripleChecker+Valid, 18191 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-03 15:40:40,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4782 Valid, 18191 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:40:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2025-03-03 15:40:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7477. [2025-03-03 15:40:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7477 states, 7013 states have (on average 1.6513617567374874) internal successors, (11581), 7081 states have internal predecessors, (11581), 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-03 15:40:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 12425 transitions. [2025-03-03 15:40:41,082 INFO L78 Accepts]: Start accepts. Automaton has 7477 states and 12425 transitions. Word has length 134 [2025-03-03 15:40:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:41,082 INFO L471 AbstractCegarLoop]: Abstraction has 7477 states and 12425 transitions. [2025-03-03 15:40:41,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 7477 states and 12425 transitions. [2025-03-03 15:40:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:41,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:41,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:40:41,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:41,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1949558972, now seen corresponding path program 1 times [2025-03-03 15:40:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200566609] [2025-03-03 15:40:41,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:41,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:41,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:41,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:41,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:41,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:41,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200566609] [2025-03-03 15:40:41,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200566609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:41,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:41,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:41,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624758286] [2025-03-03 15:40:41,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:41,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:41,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:41,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:41,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:41,189 INFO L87 Difference]: Start difference. First operand 7477 states and 12425 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:41,888 INFO L93 Difference]: Finished difference Result 19162 states and 31698 transitions. [2025-03-03 15:40:41,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:41,935 INFO L225 Difference]: With dead ends: 19162 [2025-03-03 15:40:41,935 INFO L226 Difference]: Without dead ends: 13822 [2025-03-03 15:40:41,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:40:41,952 INFO L435 NwaCegarLoop]: 4535 mSDtfsCounter, 4761 mSDsluCounter, 13644 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 18179 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-03 15:40:41,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 18179 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:40:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-03-03 15:40:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13554. [2025-03-03 15:40:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6362118320610688) internal successors, (20577), 12790 states have internal predecessors, (20577), 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-03 15:40:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22733 transitions. [2025-03-03 15:40:42,284 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22733 transitions. Word has length 134 [2025-03-03 15:40:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:42,285 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22733 transitions. [2025-03-03 15:40:42,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22733 transitions. [2025-03-03 15:40:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:42,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:42,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:42,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:40:42,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:42,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1826116037, now seen corresponding path program 1 times [2025-03-03 15:40:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423440504] [2025-03-03 15:40:42,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:42,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:42,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423440504] [2025-03-03 15:40:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423440504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:42,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037830166] [2025-03-03 15:40:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:42,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:42,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:42,375 INFO L87 Difference]: Start difference. First operand 13554 states and 22733 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:42,863 INFO L93 Difference]: Finished difference Result 27911 states and 47718 transitions. [2025-03-03 15:40:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:42,916 INFO L225 Difference]: With dead ends: 27911 [2025-03-03 15:40:42,917 INFO L226 Difference]: Without dead ends: 16494 [2025-03-03 15:40:42,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:42,953 INFO L435 NwaCegarLoop]: 4286 mSDtfsCounter, 4545 mSDsluCounter, 8458 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 12744 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-03 15:40:42,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 12744 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:40:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16494 states. [2025-03-03 15:40:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16494 to 13554. [2025-03-03 15:40:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.633587786259542) internal successors, (20544), 12790 states have internal predecessors, (20544), 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-03 15:40:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22700 transitions. [2025-03-03 15:40:43,580 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22700 transitions. Word has length 134 [2025-03-03 15:40:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:43,581 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22700 transitions. [2025-03-03 15:40:43,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22700 transitions. [2025-03-03 15:40:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:43,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:43,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:43,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:40:43,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:43,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash 839533348, now seen corresponding path program 1 times [2025-03-03 15:40:43,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:43,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305208713] [2025-03-03 15:40:43,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:43,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:43,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:43,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:43,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:43,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305208713] [2025-03-03 15:40:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305208713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:43,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906811395] [2025-03-03 15:40:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:43,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:43,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:43,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:43,697 INFO L87 Difference]: Start difference. First operand 13554 states and 22700 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:44,206 INFO L93 Difference]: Finished difference Result 27666 states and 47162 transitions. [2025-03-03 15:40:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:44,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:44,258 INFO L225 Difference]: With dead ends: 27666 [2025-03-03 15:40:44,258 INFO L226 Difference]: Without dead ends: 16249 [2025-03-03 15:40:44,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:44,291 INFO L435 NwaCegarLoop]: 4283 mSDtfsCounter, 4542 mSDsluCounter, 8453 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 12736 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-03 15:40:44,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4558 Valid, 12736 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:40:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16249 states. [2025-03-03 15:40:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16249 to 13554. [2025-03-03 15:40:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6309637404580153) internal successors, (20511), 12790 states have internal predecessors, (20511), 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-03 15:40:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22667 transitions. [2025-03-03 15:40:44,759 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22667 transitions. Word has length 134 [2025-03-03 15:40:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:44,759 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22667 transitions. [2025-03-03 15:40:44,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22667 transitions. [2025-03-03 15:40:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:44,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:44,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:44,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:40:44,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1916086757, now seen corresponding path program 1 times [2025-03-03 15:40:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164261517] [2025-03-03 15:40:44,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:44,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:44,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:44,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164261517] [2025-03-03 15:40:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164261517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:44,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498274657] [2025-03-03 15:40:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:44,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:44,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:44,874 INFO L87 Difference]: Start difference. First operand 13554 states and 22667 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:45,869 INFO L93 Difference]: Finished difference Result 40825 states and 69395 transitions. [2025-03-03 15:40:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:45,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:45,959 INFO L225 Difference]: With dead ends: 40825 [2025-03-03 15:40:45,959 INFO L226 Difference]: Without dead ends: 29408 [2025-03-03 15:40:45,991 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-03 15:40:45,991 INFO L435 NwaCegarLoop]: 4520 mSDtfsCounter, 4994 mSDsluCounter, 13596 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5019 SdHoareTripleChecker+Valid, 18116 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-03 15:40:45,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5019 Valid, 18116 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:40:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29408 states. [2025-03-03 15:40:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29408 to 26989. [2025-03-03 15:40:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.634691988894701) internal successors, (40627), 25521 states have internal predecessors, (40627), 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-03 15:40:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46879 transitions. [2025-03-03 15:40:46,899 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46879 transitions. Word has length 134 [2025-03-03 15:40:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:46,899 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46879 transitions. [2025-03-03 15:40:46,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46879 transitions. [2025-03-03 15:40:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:46,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:46,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:46,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:40:46,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:46,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash -543037692, now seen corresponding path program 1 times [2025-03-03 15:40:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:46,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513492274] [2025-03-03 15:40:46,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:46,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:46,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:46,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:46,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:47,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-03 15:40:47,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:47,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513492274] [2025-03-03 15:40:47,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513492274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:47,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:47,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334307032] [2025-03-03 15:40:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:47,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:47,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:47,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:47,018 INFO L87 Difference]: Start difference. First operand 26989 states and 46879 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:48,444 INFO L93 Difference]: Finished difference Result 58420 states and 104966 transitions. [2025-03-03 15:40:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:48,558 INFO L225 Difference]: With dead ends: 58420 [2025-03-03 15:40:48,558 INFO L226 Difference]: Without dead ends: 33568 [2025-03-03 15:40:48,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:48,612 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4536 mSDsluCounter, 8442 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4552 SdHoareTripleChecker+Valid, 12720 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-03 15:40:48,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4552 Valid, 12720 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:40:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33568 states. [2025-03-03 15:40:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33568 to 26989. [2025-03-03 15:40:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.632076610469561) internal successors, (40562), 25521 states have internal predecessors, (40562), 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-03 15:40:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46814 transitions. [2025-03-03 15:40:49,594 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46814 transitions. Word has length 134 [2025-03-03 15:40:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:49,594 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46814 transitions. [2025-03-03 15:40:49,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46814 transitions. [2025-03-03 15:40:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:49,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:49,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:49,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:40:49,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:49,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash -483816955, now seen corresponding path program 1 times [2025-03-03 15:40:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240918413] [2025-03-03 15:40:49,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:49,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:49,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:49,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:49,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:49,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:49,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240918413] [2025-03-03 15:40:49,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240918413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:49,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:49,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:49,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426945362] [2025-03-03 15:40:49,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:49,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:49,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:49,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:49,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:49,699 INFO L87 Difference]: Start difference. First operand 26989 states and 46814 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:51,783 INFO L93 Difference]: Finished difference Result 85774 states and 155330 transitions. [2025-03-03 15:40:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:52,043 INFO L225 Difference]: With dead ends: 85774 [2025-03-03 15:40:52,043 INFO L226 Difference]: Without dead ends: 60922 [2025-03-03 15:40:52,127 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-03 15:40:52,129 INFO L435 NwaCegarLoop]: 4512 mSDtfsCounter, 4921 mSDsluCounter, 13573 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4946 SdHoareTripleChecker+Valid, 18085 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-03 15:40:52,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4946 Valid, 18085 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:40:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60922 states. [2025-03-03 15:40:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60922 to 57165. [2025-03-03 15:40:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6452668439885954) internal successors, (85980), 54321 states have internal predecessors, (85980), 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-03 15:40:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106504 transitions. [2025-03-03 15:40:55,006 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106504 transitions. Word has length 134 [2025-03-03 15:40:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:55,007 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106504 transitions. [2025-03-03 15:40:55,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106504 transitions. [2025-03-03 15:40:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:40:55,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:55,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:55,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:40:55,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:55,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash 210830052, now seen corresponding path program 1 times [2025-03-03 15:40:55,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:55,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238619022] [2025-03-03 15:40:55,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:55,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:40:55,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:40:55,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:55,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:55,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:55,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238619022] [2025-03-03 15:40:55,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238619022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:55,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:55,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772176878] [2025-03-03 15:40:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:55,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:55,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:55,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:55,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:55,090 INFO L87 Difference]: Start difference. First operand 57165 states and 106504 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:40:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:58,584 INFO L93 Difference]: Finished difference Result 127516 states and 249746 transitions. [2025-03-03 15:40:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:40:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:58,948 INFO L225 Difference]: With dead ends: 127516 [2025-03-03 15:40:58,948 INFO L226 Difference]: Without dead ends: 72488 [2025-03-03 15:40:59,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:59,147 INFO L435 NwaCegarLoop]: 4260 mSDtfsCounter, 4543 mSDsluCounter, 8420 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4559 SdHoareTripleChecker+Valid, 12680 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-03 15:40:59,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4559 Valid, 12680 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:40:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72488 states. [2025-03-03 15:41:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72488 to 57165. [2025-03-03 15:41:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6427983696588147) internal successors, (85851), 54321 states have internal predecessors, (85851), 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-03 15:41:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106375 transitions. [2025-03-03 15:41:03,370 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106375 transitions. Word has length 134 [2025-03-03 15:41:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:03,370 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106375 transitions. [2025-03-03 15:41:03,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:41:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106375 transitions. [2025-03-03 15:41:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:41:03,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:03,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:03,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:41:03,385 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:03,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:03,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1341616677, now seen corresponding path program 1 times [2025-03-03 15:41:03,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:03,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973730429] [2025-03-03 15:41:03,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:03,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:41:03,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:41:03,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:03,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:03,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:03,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973730429] [2025-03-03 15:41:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973730429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:03,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:03,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:03,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262490681] [2025-03-03 15:41:03,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:03,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:03,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:03,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:03,450 INFO L87 Difference]: Start difference. First operand 57165 states and 106375 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:41:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:05,924 INFO L93 Difference]: Finished difference Result 125327 states and 245110 transitions. [2025-03-03 15:41:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:41:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:06,237 INFO L225 Difference]: With dead ends: 125327 [2025-03-03 15:41:06,237 INFO L226 Difference]: Without dead ends: 70299 [2025-03-03 15:41:06,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:06,399 INFO L435 NwaCegarLoop]: 4270 mSDtfsCounter, 4529 mSDsluCounter, 8428 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 12698 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-03 15:41:06,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4545 Valid, 12698 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70299 states. [2025-03-03 15:41:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70299 to 57165. [2025-03-03 15:41:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6403298953290342) internal successors, (85722), 54321 states have internal predecessors, (85722), 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-03 15:41:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106246 transitions. [2025-03-03 15:41:10,785 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106246 transitions. Word has length 134 [2025-03-03 15:41:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:10,785 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106246 transitions. [2025-03-03 15:41:10,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:41:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106246 transitions. [2025-03-03 15:41:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:41:10,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:10,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:10,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:41:10,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:10,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 408262340, now seen corresponding path program 1 times [2025-03-03 15:41:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268445915] [2025-03-03 15:41:10,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:10,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:41:10,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:41:10,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:10,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268445915] [2025-03-03 15:41:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268445915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:10,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:10,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:10,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303115731] [2025-03-03 15:41:10,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:10,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:10,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:10,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:10,882 INFO L87 Difference]: Start difference. First operand 57165 states and 106246 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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)