./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 54f1be55645106b43145d214f59b6f833268ce7c7f84e399c536bf03a2c9679b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:09:50,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:09:50,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:09:50,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:09:50,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:09:50,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:09:50,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:09:50,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:09:50,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:09:50,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:09:50,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:09:50,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:09:50,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:09:50,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:09:50,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:09:50,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:50,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:09:50,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:09:50,471 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-jdk21/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 -> 54f1be55645106b43145d214f59b6f833268ce7c7f84e399c536bf03a2c9679b [2025-02-05 17:09:50,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:09:50,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:09:50,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:09:50,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:09:50,687 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:09:50,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c [2025-02-05 17:09:51,747 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e92437175/a6a38d3f6db2482b9b0194084e4858f5/FLAG722c5d609 [2025-02-05 17:09:52,221 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:09:52,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c [2025-02-05 17:09:52,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e92437175/a6a38d3f6db2482b9b0194084e4858f5/FLAG722c5d609 [2025-02-05 17:09:52,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e92437175/a6a38d3f6db2482b9b0194084e4858f5 [2025-02-05 17:09:52,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:09:52,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:09:52,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:52,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:09:52,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:09:52,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:52,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e94045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52, skipping insertion in model container [2025-02-05 17:09:52,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:52,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:09:53,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c[381679,381692] [2025-02-05 17:09:53,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c[383339,383352] [2025-02-05 17:09:53,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:53,802 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:09:54,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c[381679,381692] [2025-02-05 17:09:54,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c[383339,383352] [2025-02-05 17:09:54,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:54,411 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:09:54,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54 WrapperNode [2025-02-05 17:09:54,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:54,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:54,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:09:54,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:09:54,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:54,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:54,821 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-02-05 17:09:54,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:54,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:09:54,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:09:54,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:09:54,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:54,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:54,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:54,946 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-02-05 17:09:54,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:54,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:55,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:55,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:55,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:55,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:55,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:09:55,272 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:09:55,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:09:55,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:09:55,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (1/1) ... [2025-02-05 17:09:55,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:09:55,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:09:55,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:09:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:09:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:09:55,336 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:09:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:09:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:09:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:09:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:09:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:09:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:09:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:09:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:09:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:09:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:09:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:09:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:09:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:09:55,433 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:09:55,435 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:10:01,729 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:10:01,730 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:10:01,730 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:10:01,730 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:10:01,731 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:10:01,731 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:10:01,731 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:10:01,987 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2025-02-05 17:10:01,988 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:10:02,037 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:10:02,038 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:10:02,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:10:02 BoogieIcfgContainer [2025-02-05 17:10:02,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:10:02,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:10:02,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:10:02,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:10:02,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:09:52" (1/3) ... [2025-02-05 17:10:02,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d8efa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:10:02, skipping insertion in model container [2025-02-05 17:10:02,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:54" (2/3) ... [2025-02-05 17:10:02,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d8efa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:10:02, skipping insertion in model container [2025-02-05 17:10:02,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:10:02" (3/3) ... [2025-02-05 17:10:02,046 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.07.cil-1.c [2025-02-05 17:10:02,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:10:02,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.07.cil-1.c that has 7 procedures, 2456 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-02-05 17:10:02,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:10:02,125 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;@7bb49835, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:10:02,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:10:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 2426 states have (on average 1.8396537510305029) internal successors, (4463), 2429 states have internal predecessors, (4463), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 17:10:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:02,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:02,141 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] [2025-02-05 17:10:02,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:02,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash 306970183, now seen corresponding path program 1 times [2025-02-05 17:10:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490832154] [2025-02-05 17:10:02,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:02,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:02,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:02,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:02,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:02,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:02,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:02,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490832154] [2025-02-05 17:10:02,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490832154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:02,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:02,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584693541] [2025-02-05 17:10:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:02,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:02,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:02,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:02,616 INFO L87 Difference]: Start difference. First operand has 2456 states, 2426 states have (on average 1.8396537510305029) internal successors, (4463), 2429 states have internal predecessors, (4463), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:03,066 INFO L93 Difference]: Finished difference Result 4911 states and 9015 transitions. [2025-02-05 17:10:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:03,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:03,087 INFO L225 Difference]: With dead ends: 4911 [2025-02-05 17:10:03,087 INFO L226 Difference]: Without dead ends: 2405 [2025-02-05 17:10:03,095 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-02-05 17:10:03,097 INFO L435 NwaCegarLoop]: 4332 mSDtfsCounter, 4559 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 12891 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:03,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 12891 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2025-02-05 17:10:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2389. [2025-02-05 17:10:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2360 states have (on average 1.8309322033898305) internal successors, (4321), 2362 states have internal predecessors, (4321), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 17:10:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 4363 transitions. [2025-02-05 17:10:03,201 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 4363 transitions. Word has length 123 [2025-02-05 17:10:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:03,201 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 4363 transitions. [2025-02-05 17:10:03,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 4363 transitions. [2025-02-05 17:10:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:03,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:03,205 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] [2025-02-05 17:10:03,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:10:03,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1001617190, now seen corresponding path program 1 times [2025-02-05 17:10:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:03,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010017501] [2025-02-05 17:10:03,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:03,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:03,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:03,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:03,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:03,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010017501] [2025-02-05 17:10:03,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010017501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:03,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:03,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:03,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294223912] [2025-02-05 17:10:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:03,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:03,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:03,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:03,430 INFO L87 Difference]: Start difference. First operand 2389 states and 4363 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:03,970 INFO L93 Difference]: Finished difference Result 2939 states and 5215 transitions. [2025-02-05 17:10:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:03,980 INFO L225 Difference]: With dead ends: 2939 [2025-02-05 17:10:03,980 INFO L226 Difference]: Without dead ends: 2686 [2025-02-05 17:10:03,982 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-02-05 17:10:03,982 INFO L435 NwaCegarLoop]: 4491 mSDtfsCounter, 4692 mSDsluCounter, 13585 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4707 SdHoareTripleChecker+Valid, 18076 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:03,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4707 Valid, 18076 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-02-05 17:10:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2654. [2025-02-05 17:10:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2599 states have (on average 1.8033859176606386) internal successors, (4687), 2603 states have internal predecessors, (4687), 39 states have call successors, (39), 12 states have call predecessors, (39), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-02-05 17:10:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 4772 transitions. [2025-02-05 17:10:04,032 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 4772 transitions. Word has length 123 [2025-02-05 17:10:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:04,033 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 4772 transitions. [2025-02-05 17:10:04,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 4772 transitions. [2025-02-05 17:10:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:04,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:04,034 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] [2025-02-05 17:10:04,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:10:04,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2132403815, now seen corresponding path program 1 times [2025-02-05 17:10:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104494980] [2025-02-05 17:10:04,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:04,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:04,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:04,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:04,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104494980] [2025-02-05 17:10:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104494980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:04,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:04,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:04,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223512719] [2025-02-05 17:10:04,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:04,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:04,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:04,336 INFO L87 Difference]: Start difference. First operand 2654 states and 4772 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:04,893 INFO L93 Difference]: Finished difference Result 3730 states and 6437 transitions. [2025-02-05 17:10:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:04,905 INFO L225 Difference]: With dead ends: 3730 [2025-02-05 17:10:04,905 INFO L226 Difference]: Without dead ends: 3214 [2025-02-05 17:10:04,907 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-02-05 17:10:04,907 INFO L435 NwaCegarLoop]: 4455 mSDtfsCounter, 4688 mSDsluCounter, 13509 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4703 SdHoareTripleChecker+Valid, 17964 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:04,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4703 Valid, 17964 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2025-02-05 17:10:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3170. [2025-02-05 17:10:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3067 states have (on average 1.7606781871535702) internal successors, (5400), 3075 states have internal predecessors, (5400), 71 states have call successors, (71), 24 states have call predecessors, (71), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-02-05 17:10:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 5565 transitions. [2025-02-05 17:10:04,991 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 5565 transitions. Word has length 123 [2025-02-05 17:10:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:04,991 INFO L471 AbstractCegarLoop]: Abstraction has 3170 states and 5565 transitions. [2025-02-05 17:10:04,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 5565 transitions. [2025-02-05 17:10:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:04,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:04,993 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] [2025-02-05 17:10:04,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:10:04,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:04,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1199049478, now seen corresponding path program 1 times [2025-02-05 17:10:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:04,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404248470] [2025-02-05 17:10:04,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:05,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:05,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:05,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:05,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:05,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404248470] [2025-02-05 17:10:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404248470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:05,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:05,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:05,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571337613] [2025-02-05 17:10:05,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:05,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:05,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:05,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:05,107 INFO L87 Difference]: Start difference. First operand 3170 states and 5565 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:05,609 INFO L93 Difference]: Finished difference Result 5375 states and 9016 transitions. [2025-02-05 17:10:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:05,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:05,728 INFO L225 Difference]: With dead ends: 5375 [2025-02-05 17:10:05,729 INFO L226 Difference]: Without dead ends: 4343 [2025-02-05 17:10:05,731 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-02-05 17:10:05,732 INFO L435 NwaCegarLoop]: 4452 mSDtfsCounter, 4683 mSDsluCounter, 13496 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 17948 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:05,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 17948 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2025-02-05 17:10:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 4276. [2025-02-05 17:10:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4071 states have (on average 1.7081798084008843) internal successors, (6954), 4093 states have internal predecessors, (6954), 135 states have call successors, (135), 48 states have call predecessors, (135), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-02-05 17:10:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7303 transitions. [2025-02-05 17:10:05,830 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7303 transitions. Word has length 123 [2025-02-05 17:10:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:05,831 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7303 transitions. [2025-02-05 17:10:05,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7303 transitions. [2025-02-05 17:10:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:05,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:05,833 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] [2025-02-05 17:10:05,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:10:05,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:05,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1602005369, now seen corresponding path program 1 times [2025-02-05 17:10:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:05,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659723422] [2025-02-05 17:10:05,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:05,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:05,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:05,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:05,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:05,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:05,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:05,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659723422] [2025-02-05 17:10:05,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659723422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:05,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:05,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:05,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433424313] [2025-02-05 17:10:05,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:05,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:05,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:05,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:05,949 INFO L87 Difference]: Start difference. First operand 4276 states and 7303 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:06,492 INFO L93 Difference]: Finished difference Result 8942 states and 14770 transitions. [2025-02-05 17:10:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:06,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:06,522 INFO L225 Difference]: With dead ends: 8942 [2025-02-05 17:10:06,522 INFO L226 Difference]: Without dead ends: 6804 [2025-02-05 17:10:06,531 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-02-05 17:10:06,533 INFO L435 NwaCegarLoop]: 4450 mSDtfsCounter, 4678 mSDsluCounter, 13484 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 17934 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:06,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 17934 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6804 states. [2025-02-05 17:10:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6804 to 6694. [2025-02-05 17:10:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6694 states, 6267 states have (on average 1.6620392532312112) internal successors, (10416), 6335 states have internal predecessors, (10416), 263 states have call successors, (263), 96 states have call predecessors, (263), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-02-05 17:10:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6694 states to 6694 states and 11229 transitions. [2025-02-05 17:10:06,856 INFO L78 Accepts]: Start accepts. Automaton has 6694 states and 11229 transitions. Word has length 123 [2025-02-05 17:10:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:06,857 INFO L471 AbstractCegarLoop]: Abstraction has 6694 states and 11229 transitions. [2025-02-05 17:10:06,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6694 states and 11229 transitions. [2025-02-05 17:10:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:06,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:06,862 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] [2025-02-05 17:10:06,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:10:06,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:06,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1494226662, now seen corresponding path program 1 times [2025-02-05 17:10:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:06,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140167698] [2025-02-05 17:10:06,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:06,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:06,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:06,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:06,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:06,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:06,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140167698] [2025-02-05 17:10:06,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140167698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:06,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:06,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:06,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530967980] [2025-02-05 17:10:06,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:06,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:06,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:06,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:06,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:06,992 INFO L87 Difference]: Start difference. First operand 6694 states and 11229 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:07,794 INFO L93 Difference]: Finished difference Result 16841 states and 28060 transitions. [2025-02-05 17:10:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:07,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:07,854 INFO L225 Difference]: With dead ends: 16841 [2025-02-05 17:10:07,854 INFO L226 Difference]: Without dead ends: 12285 [2025-02-05 17:10:07,867 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-02-05 17:10:07,869 INFO L435 NwaCegarLoop]: 4449 mSDtfsCounter, 4673 mSDsluCounter, 13473 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 17922 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:07,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 17922 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12285 states. [2025-02-05 17:10:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12285 to 12096. [2025-02-05 17:10:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6383492972876197) internal successors, (18302), 11385 states have internal predecessors, (18302), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:10:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20427 transitions. [2025-02-05 17:10:08,411 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20427 transitions. Word has length 123 [2025-02-05 17:10:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:08,412 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20427 transitions. [2025-02-05 17:10:08,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20427 transitions. [2025-02-05 17:10:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:08,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:08,419 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] [2025-02-05 17:10:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:10:08,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2009747111, now seen corresponding path program 1 times [2025-02-05 17:10:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041716552] [2025-02-05 17:10:08,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:08,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:08,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:08,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:08,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041716552] [2025-02-05 17:10:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041716552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:08,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:08,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:08,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001774583] [2025-02-05 17:10:08,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:08,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:08,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:08,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:08,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:08,510 INFO L87 Difference]: Start difference. First operand 12096 states and 20427 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:08,999 INFO L93 Difference]: Finished difference Result 24486 states and 42155 transitions. [2025-02-05 17:10:08,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:09,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:09,047 INFO L225 Difference]: With dead ends: 24486 [2025-02-05 17:10:09,047 INFO L226 Difference]: Without dead ends: 14526 [2025-02-05 17:10:09,073 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-02-05 17:10:09,074 INFO L435 NwaCegarLoop]: 4252 mSDtfsCounter, 4484 mSDsluCounter, 8400 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 12652 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:09,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4499 Valid, 12652 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14526 states. [2025-02-05 17:10:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14526 to 12096. [2025-02-05 17:10:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6353952197654642) internal successors, (18269), 11385 states have internal predecessors, (18269), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:10:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20394 transitions. [2025-02-05 17:10:09,861 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20394 transitions. Word has length 123 [2025-02-05 17:10:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:09,862 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20394 transitions. [2025-02-05 17:10:09,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20394 transitions. [2025-02-05 17:10:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:09,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:09,870 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] [2025-02-05 17:10:09,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:10:09,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:09,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:09,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1056545478, now seen corresponding path program 1 times [2025-02-05 17:10:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540097929] [2025-02-05 17:10:09,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:09,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:09,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:09,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540097929] [2025-02-05 17:10:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540097929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:09,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:09,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11951299] [2025-02-05 17:10:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:09,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:09,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:09,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:09,971 INFO L87 Difference]: Start difference. First operand 12096 states and 20394 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:10,580 INFO L93 Difference]: Finished difference Result 24000 states and 41117 transitions. [2025-02-05 17:10:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:10,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:10,623 INFO L225 Difference]: With dead ends: 24000 [2025-02-05 17:10:10,624 INFO L226 Difference]: Without dead ends: 14040 [2025-02-05 17:10:10,647 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-02-05 17:10:10,648 INFO L435 NwaCegarLoop]: 4247 mSDtfsCounter, 4478 mSDsluCounter, 8389 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4493 SdHoareTripleChecker+Valid, 12636 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:10,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4493 Valid, 12636 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14040 states. [2025-02-05 17:10:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14040 to 12096. [2025-02-05 17:10:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6324411422433085) internal successors, (18236), 11385 states have internal predecessors, (18236), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:10:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20361 transitions. [2025-02-05 17:10:11,108 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20361 transitions. Word has length 123 [2025-02-05 17:10:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:11,109 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20361 transitions. [2025-02-05 17:10:11,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20361 transitions. [2025-02-05 17:10:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:11,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:11,116 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] [2025-02-05 17:10:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:10:11,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash 528179877, now seen corresponding path program 1 times [2025-02-05 17:10:11,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:11,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425970591] [2025-02-05 17:10:11,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:11,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:11,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:11,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:11,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:11,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425970591] [2025-02-05 17:10:11,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425970591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:11,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:11,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865979738] [2025-02-05 17:10:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:11,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:11,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:11,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:11,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:11,237 INFO L87 Difference]: Start difference. First operand 12096 states and 20361 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:12,549 INFO L93 Difference]: Finished difference Result 35183 states and 60205 transitions. [2025-02-05 17:10:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:12,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:12,702 INFO L225 Difference]: With dead ends: 35183 [2025-02-05 17:10:12,703 INFO L226 Difference]: Without dead ends: 25225 [2025-02-05 17:10:12,729 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-02-05 17:10:12,733 INFO L435 NwaCegarLoop]: 4435 mSDtfsCounter, 4814 mSDsluCounter, 13406 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4837 SdHoareTripleChecker+Valid, 17841 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:12,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4837 Valid, 17841 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:10:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25225 states. [2025-02-05 17:10:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25225 to 23616. [2025-02-05 17:10:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6230929747275677) internal successors, (35002), 22233 states have internal predecessors, (35002), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:10:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41223 transitions. [2025-02-05 17:10:13,683 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41223 transitions. Word has length 123 [2025-02-05 17:10:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:13,683 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41223 transitions. [2025-02-05 17:10:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41223 transitions. [2025-02-05 17:10:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:13,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:13,693 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] [2025-02-05 17:10:13,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:10:13,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1203872486, now seen corresponding path program 1 times [2025-02-05 17:10:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905636690] [2025-02-05 17:10:13,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:13,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:13,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:13,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:13,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905636690] [2025-02-05 17:10:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905636690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84456401] [2025-02-05 17:10:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:13,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:13,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:13,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:13,788 INFO L87 Difference]: Start difference. First operand 23616 states and 41223 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:15,142 INFO L93 Difference]: Finished difference Result 49470 states and 89377 transitions. [2025-02-05 17:10:15,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:15,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:15,238 INFO L225 Difference]: With dead ends: 49470 [2025-02-05 17:10:15,239 INFO L226 Difference]: Without dead ends: 27990 [2025-02-05 17:10:15,280 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-02-05 17:10:15,281 INFO L435 NwaCegarLoop]: 4242 mSDtfsCounter, 4474 mSDsluCounter, 8380 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4489 SdHoareTripleChecker+Valid, 12622 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:15,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4489 Valid, 12622 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27990 states. [2025-02-05 17:10:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27990 to 23616. [2025-02-05 17:10:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6200788314398331) internal successors, (34937), 22233 states have internal predecessors, (34937), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:10:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41158 transitions. [2025-02-05 17:10:16,645 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41158 transitions. Word has length 123 [2025-02-05 17:10:16,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:16,646 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41158 transitions. [2025-02-05 17:10:16,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41158 transitions. [2025-02-05 17:10:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:16,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:16,667 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] [2025-02-05 17:10:16,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:10:16,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:16,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash 394385029, now seen corresponding path program 1 times [2025-02-05 17:10:16,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:16,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965234973] [2025-02-05 17:10:16,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:16,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:16,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:16,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:16,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:16,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:16,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:16,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965234973] [2025-02-05 17:10:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965234973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:16,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860393634] [2025-02-05 17:10:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:16,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:16,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:16,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:16,809 INFO L87 Difference]: Start difference. First operand 23616 states and 41158 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:17,878 INFO L93 Difference]: Finished difference Result 48741 states and 87789 transitions. [2025-02-05 17:10:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:17,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:17,969 INFO L225 Difference]: With dead ends: 48741 [2025-02-05 17:10:17,970 INFO L226 Difference]: Without dead ends: 27261 [2025-02-05 17:10:18,007 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-02-05 17:10:18,008 INFO L435 NwaCegarLoop]: 4239 mSDtfsCounter, 4471 mSDsluCounter, 8375 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4486 SdHoareTripleChecker+Valid, 12614 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:18,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4486 Valid, 12614 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27261 states. [2025-02-05 17:10:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27261 to 23616. [2025-02-05 17:10:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6170646881520983) internal successors, (34872), 22233 states have internal predecessors, (34872), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:10:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41093 transitions. [2025-02-05 17:10:20,312 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41093 transitions. Word has length 123 [2025-02-05 17:10:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:20,313 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41093 transitions. [2025-02-05 17:10:20,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41093 transitions. [2025-02-05 17:10:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:20,321 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] [2025-02-05 17:10:20,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:10:20,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash -47369466, now seen corresponding path program 1 times [2025-02-05 17:10:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:20,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527800005] [2025-02-05 17:10:20,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:20,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:20,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:20,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:20,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527800005] [2025-02-05 17:10:20,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527800005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:20,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:20,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:20,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002821292] [2025-02-05 17:10:20,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:20,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:20,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:20,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:20,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:20,411 INFO L87 Difference]: Start difference. First operand 23616 states and 41093 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:22,236 INFO L93 Difference]: Finished difference Result 70918 states and 129599 transitions. [2025-02-05 17:10:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:22,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:22,602 INFO L225 Difference]: With dead ends: 70918 [2025-02-05 17:10:22,603 INFO L226 Difference]: Without dead ends: 49440 [2025-02-05 17:10:22,644 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-02-05 17:10:22,644 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 4703 mSDsluCounter, 13351 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4726 SdHoareTripleChecker+Valid, 17772 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:22,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4726 Valid, 17772 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49440 states. [2025-02-05 17:10:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49440 to 47770. [2025-02-05 17:10:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47770 states, 43013 states have (on average 1.6074675098226117) internal successors, (69142), 45075 states have internal predecessors, (69142), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-02-05 17:10:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47770 states to 47770 states and 89635 transitions. [2025-02-05 17:10:25,118 INFO L78 Accepts]: Start accepts. Automaton has 47770 states and 89635 transitions. Word has length 123 [2025-02-05 17:10:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:25,119 INFO L471 AbstractCegarLoop]: Abstraction has 47770 states and 89635 transitions. [2025-02-05 17:10:25,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 47770 states and 89635 transitions. [2025-02-05 17:10:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:25,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:25,134 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] [2025-02-05 17:10:25,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:10:25,135 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash -61619611, now seen corresponding path program 1 times [2025-02-05 17:10:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:25,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041737540] [2025-02-05 17:10:25,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:25,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:25,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:25,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:25,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041737540] [2025-02-05 17:10:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041737540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:25,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:25,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771534110] [2025-02-05 17:10:25,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:25,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:25,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:25,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:25,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:25,208 INFO L87 Difference]: Start difference. First operand 47770 states and 89635 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:27,998 INFO L93 Difference]: Finished difference Result 99965 states and 198745 transitions. [2025-02-05 17:10:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:28,204 INFO L225 Difference]: With dead ends: 99965 [2025-02-05 17:10:28,204 INFO L226 Difference]: Without dead ends: 54331 [2025-02-05 17:10:28,296 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-02-05 17:10:28,300 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 4467 mSDsluCounter, 8366 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 12600 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:28,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 12600 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54331 states. [2025-02-05 17:10:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54331 to 47770. [2025-02-05 17:10:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47770 states, 43013 states have (on average 1.6044684165252365) internal successors, (69013), 45075 states have internal predecessors, (69013), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-02-05 17:10:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47770 states to 47770 states and 89506 transitions. [2025-02-05 17:10:33,156 INFO L78 Accepts]: Start accepts. Automaton has 47770 states and 89506 transitions. Word has length 123 [2025-02-05 17:10:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:33,157 INFO L471 AbstractCegarLoop]: Abstraction has 47770 states and 89506 transitions. [2025-02-05 17:10:33,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 47770 states and 89506 transitions. [2025-02-05 17:10:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:33,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:33,183 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] [2025-02-05 17:10:33,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:10:33,183 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1031910618, now seen corresponding path program 1 times [2025-02-05 17:10:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565989977] [2025-02-05 17:10:33,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:33,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:33,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:33,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:33,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:33,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:33,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565989977] [2025-02-05 17:10:33,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565989977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:33,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:33,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:33,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047960609] [2025-02-05 17:10:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:33,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:33,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:33,385 INFO L87 Difference]: Start difference. First operand 47770 states and 89506 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:37,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:37,601 INFO L93 Difference]: Finished difference Result 144256 states and 297337 transitions. [2025-02-05 17:10:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:37,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:10:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:38,094 INFO L225 Difference]: With dead ends: 144256 [2025-02-05 17:10:38,094 INFO L226 Difference]: Without dead ends: 98624 [2025-02-05 17:10:38,231 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-02-05 17:10:38,232 INFO L435 NwaCegarLoop]: 4414 mSDtfsCounter, 4630 mSDsluCounter, 13320 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4653 SdHoareTripleChecker+Valid, 17734 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:38,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4653 Valid, 17734 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:10:38,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98624 states. [2025-02-05 17:10:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98624 to 97340. [2025-02-05 17:10:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97340 states, 85777 states have (on average 1.5827902584608928) internal successors, (135767), 92085 states have internal predecessors, (135767), 3719 states have call successors, (3719), 1536 states have call predecessors, (3719), 7842 states have return successors, (69766), 3974 states have call predecessors, (69766), 3719 states have call successors, (69766) [2025-02-05 17:10:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97340 states to 97340 states and 209252 transitions. [2025-02-05 17:10:46,466 INFO L78 Accepts]: Start accepts. Automaton has 97340 states and 209252 transitions. Word has length 123 [2025-02-05 17:10:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:46,467 INFO L471 AbstractCegarLoop]: Abstraction has 97340 states and 209252 transitions. [2025-02-05 17:10:46,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:10:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 97340 states and 209252 transitions. [2025-02-05 17:10:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:10:46,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:46,497 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] [2025-02-05 17:10:46,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:10:46,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:46,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -93379003, now seen corresponding path program 1 times [2025-02-05 17:10:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810402880] [2025-02-05 17:10:46,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:46,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:46,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:10:46,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:10:46,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:46,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:46,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:46,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810402880] [2025-02-05 17:10:46,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810402880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:46,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:46,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:10:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134149496] [2025-02-05 17:10:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:46,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:10:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:46,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:10:46,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:10:46,542 INFO L87 Difference]: Start difference. First operand 97340 states and 209252 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)