./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_label48+token_ring.08.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 06a966cd103a9c61c8e9ebcc5255a2d5a7d1dd56b172674853cec63a372f0a43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:17:46,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:17:46,371 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:17:46,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:17:46,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:17:46,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:17:46,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:17:46,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:17:46,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:17:46,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:17:46,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:17:46,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:17:46,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:17:46,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:17:46,391 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:17:46,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:17:46,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:17:46,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:17:46,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:17:46,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:17:46,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:17:46,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:17:46,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:17:46,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:17:46,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:17:46,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:17:46,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:17:46,393 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 -> 06a966cd103a9c61c8e9ebcc5255a2d5a7d1dd56b172674853cec63a372f0a43 [2025-02-05 17:17:46,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:17:46,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:17:46,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:17:46,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:17:46,647 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:17:46,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c [2025-02-05 17:17:47,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84775e7b9/47c3e61c9e004ca49746ae6b69849904/FLAG5ae34719c [2025-02-05 17:17:48,454 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:17:48,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c [2025-02-05 17:17:48,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84775e7b9/47c3e61c9e004ca49746ae6b69849904/FLAG5ae34719c [2025-02-05 17:17:48,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84775e7b9/47c3e61c9e004ca49746ae6b69849904 [2025-02-05 17:17:48,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:17:48,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:17:48,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:17:48,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:17:48,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:17:48,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:17:48" (1/1) ... [2025-02-05 17:17:48,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2290bd9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:48, skipping insertion in model container [2025-02-05 17:17:48,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:17:48" (1/1) ... [2025-02-05 17:17:48,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:17:49,832 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_label48+token_ring.08.cil-1.c[375709,375722] [2025-02-05 17:17:49,860 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_label48+token_ring.08.cil-1.c[383339,383352] [2025-02-05 17:17:50,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:17:50,110 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:17:50,671 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_label48+token_ring.08.cil-1.c[375709,375722] [2025-02-05 17:17:50,678 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_label48+token_ring.08.cil-1.c[383339,383352] [2025-02-05 17:17:50,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:17:50,742 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:17:50,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50 WrapperNode [2025-02-05 17:17:50,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:17:50,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:17:50,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:17:50,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:17:50,750 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:17:50" (1/1) ... [2025-02-05 17:17:50,806 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:17:50" (1/1) ... [2025-02-05 17:17:51,097 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-02-05 17:17:51,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:17:51,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:17:51,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:17:51,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:17:51,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,301 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:17:51,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:17:51,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:17:51,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:17:51,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:17:51,688 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:51,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:17:51,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:17:51,734 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:17:51,738 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:17:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:17:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:17:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:17:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:17:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:17:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:17:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:17:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:17:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:17:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:17:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:17:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:17:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:17:51,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:17:51,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:17:51,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:17:51,864 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:17:51,866 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:17:58,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:17:58,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:17:58,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:17:58,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:17:58,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:17:58,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:17:58,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:17:58,424 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-02-05 17:17:58,425 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:17:58,510 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:17:58,511 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:17:58,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:17:58 BoogieIcfgContainer [2025-02-05 17:17:58,511 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:17:58,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:17:58,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:17:58,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:17:58,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:17:48" (1/3) ... [2025-02-05 17:17:58,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cfe606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:17:58, skipping insertion in model container [2025-02-05 17:17:58,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50" (2/3) ... [2025-02-05 17:17:58,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cfe606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:17:58, skipping insertion in model container [2025-02-05 17:17:58,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:17:58" (3/3) ... [2025-02-05 17:17:58,555 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.08.cil-1.c [2025-02-05 17:17:58,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:17:58,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label48+token_ring.08.cil-1.c that has 7 procedures, 2483 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-02-05 17:17:58,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:17:58,729 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;@75296256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:17:58,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:17:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 17:17:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:17:58,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:58,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:58,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:58,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash 840339491, now seen corresponding path program 1 times [2025-02-05 17:17:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:58,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12657923] [2025-02-05 17:17:58,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:58,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:17:58,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:17:58,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:58,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:59,264 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:17:59,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:59,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12657923] [2025-02-05 17:17:59,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12657923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:59,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:59,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:17:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529413331] [2025-02-05 17:17:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:59,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:17:59,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:59,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:17:59,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:17:59,298 INFO L87 Difference]: Start difference. First operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:17:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:59,905 INFO L93 Difference]: Finished difference Result 5264 states and 9573 transitions. [2025-02-05 17:17:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:17:59,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:17:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:59,932 INFO L225 Difference]: With dead ends: 5264 [2025-02-05 17:17:59,932 INFO L226 Difference]: Without dead ends: 2727 [2025-02-05 17:17:59,940 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:17:59,942 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4854 mSDsluCounter, 8959 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4870 SdHoareTripleChecker+Valid, 13339 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:59,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4870 Valid, 13339 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:17:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2025-02-05 17:18:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2706. [2025-02-05 17:18:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7997737556561086) internal successors, (4773), 2655 states have internal predecessors, (4773), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-05 17:18:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4852 transitions. [2025-02-05 17:18:00,079 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4852 transitions. Word has length 134 [2025-02-05 17:18:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:00,080 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4852 transitions. [2025-02-05 17:18:00,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4852 transitions. [2025-02-05 17:18:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:00,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:00,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:00,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:18:00,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:00,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash -12912283, now seen corresponding path program 1 times [2025-02-05 17:18:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:00,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117935114] [2025-02-05 17:18:00,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:00,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:00,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:00,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:00,309 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:18:00,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:00,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117935114] [2025-02-05 17:18:00,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117935114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:00,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:00,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52855361] [2025-02-05 17:18:00,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:00,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:00,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:00,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:00,311 INFO L87 Difference]: Start difference. First operand 2706 states and 4852 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:00,651 INFO L93 Difference]: Finished difference Result 3329 states and 5825 transitions. [2025-02-05 17:18:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:00,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:00,662 INFO L225 Difference]: With dead ends: 3329 [2025-02-05 17:18:00,662 INFO L226 Difference]: Without dead ends: 2760 [2025-02-05 17:18:00,665 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:18:00,666 INFO L435 NwaCegarLoop]: 4299 mSDtfsCounter, 4553 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 12782 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:00,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 12782 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2025-02-05 17:18:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2706. [2025-02-05 17:18:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7990196078431373) internal successors, (4771), 2655 states have internal predecessors, (4771), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-05 17:18:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4850 transitions. [2025-02-05 17:18:00,736 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4850 transitions. Word has length 134 [2025-02-05 17:18:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:00,737 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4850 transitions. [2025-02-05 17:18:00,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4850 transitions. [2025-02-05 17:18:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:00,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:00,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:00,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:18:00,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:00,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1159452796, now seen corresponding path program 1 times [2025-02-05 17:18:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:00,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429797413] [2025-02-05 17:18:00,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:00,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:00,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:00,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:00,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:00,886 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:18:00,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429797413] [2025-02-05 17:18:00,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429797413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:00,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084127429] [2025-02-05 17:18:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:00,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:00,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:00,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:00,888 INFO L87 Difference]: Start difference. First operand 2706 states and 4850 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:01,495 INFO L93 Difference]: Finished difference Result 3634 states and 6288 transitions. [2025-02-05 17:18:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:01,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:01,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:01,510 INFO L225 Difference]: With dead ends: 3634 [2025-02-05 17:18:01,510 INFO L226 Difference]: Without dead ends: 3065 [2025-02-05 17:18:01,514 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:18:01,514 INFO L435 NwaCegarLoop]: 4548 mSDtfsCounter, 4781 mSDsluCounter, 13683 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4797 SdHoareTripleChecker+Valid, 18231 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:01,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4797 Valid, 18231 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:18:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2025-02-05 17:18:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2976. [2025-02-05 17:18:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2898 states have (on average 1.7736369910282954) internal successors, (5140), 2902 states have internal predecessors, (5140), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-02-05 17:18:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5256 transitions. [2025-02-05 17:18:01,593 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5256 transitions. Word has length 134 [2025-02-05 17:18:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:01,593 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5256 transitions. [2025-02-05 17:18:01,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5256 transitions. [2025-02-05 17:18:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:01,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:01,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:01,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:18:01,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:01,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1851603333, now seen corresponding path program 1 times [2025-02-05 17:18:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:01,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761390371] [2025-02-05 17:18:01,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:01,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:01,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:01,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:01,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:01,721 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:18:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761390371] [2025-02-05 17:18:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761390371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:01,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:01,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034781973] [2025-02-05 17:18:01,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:01,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:01,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:01,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:01,723 INFO L87 Difference]: Start difference. First operand 2976 states and 5256 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:02,365 INFO L93 Difference]: Finished difference Result 4487 states and 7591 transitions. [2025-02-05 17:18:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:02,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:02,380 INFO L225 Difference]: With dead ends: 4487 [2025-02-05 17:18:02,381 INFO L226 Difference]: Without dead ends: 3648 [2025-02-05 17:18:02,384 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:18:02,385 INFO L435 NwaCegarLoop]: 4544 mSDtfsCounter, 4776 mSDsluCounter, 13671 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4792 SdHoareTripleChecker+Valid, 18215 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:02,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4792 Valid, 18215 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:18:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2025-02-05 17:18:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3547. [2025-02-05 17:18:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3419 states have (on average 1.7353027200935947) internal successors, (5933), 3427 states have internal predecessors, (5933), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-02-05 17:18:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 6129 transitions. [2025-02-05 17:18:02,473 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 6129 transitions. Word has length 134 [2025-02-05 17:18:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:02,473 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 6129 transitions. [2025-02-05 17:18:02,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 6129 transitions. [2025-02-05 17:18:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:02,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:02,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:02,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:18:02,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:02,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2087281508, now seen corresponding path program 1 times [2025-02-05 17:18:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861066815] [2025-02-05 17:18:02,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:02,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:02,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:02,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:02,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:02,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:02,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861066815] [2025-02-05 17:18:02,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861066815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:02,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:02,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303500070] [2025-02-05 17:18:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:02,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:02,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:02,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:02,592 INFO L87 Difference]: Start difference. First operand 3547 states and 6129 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:03,117 INFO L93 Difference]: Finished difference Result 6312 states and 10438 transitions. [2025-02-05 17:18:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:03,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:03,136 INFO L225 Difference]: With dead ends: 6312 [2025-02-05 17:18:03,136 INFO L226 Difference]: Without dead ends: 4902 [2025-02-05 17:18:03,142 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:18:03,143 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 4797 mSDsluCounter, 13155 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4813 SdHoareTripleChecker+Valid, 17486 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:03,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4813 Valid, 17486 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2025-02-05 17:18:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4776. [2025-02-05 17:18:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4542 states have (on average 1.6893439013650375) internal successors, (7673), 4564 states have internal predecessors, (7673), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-02-05 17:18:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 8053 transitions. [2025-02-05 17:18:03,279 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 8053 transitions. Word has length 134 [2025-02-05 17:18:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:03,279 INFO L471 AbstractCegarLoop]: Abstraction has 4776 states and 8053 transitions. [2025-02-05 17:18:03,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 8053 transitions. [2025-02-05 17:18:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:03,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:03,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:03,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:18:03,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:03,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1263600037, now seen corresponding path program 1 times [2025-02-05 17:18:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696153779] [2025-02-05 17:18:03,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:03,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:03,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:03,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:03,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:03,500 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:18:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696153779] [2025-02-05 17:18:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696153779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:03,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714005885] [2025-02-05 17:18:03,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:03,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:03,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:03,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:03,506 INFO L87 Difference]: Start difference. First operand 4776 states and 8053 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:04,276 INFO L93 Difference]: Finished difference Result 10291 states and 16832 transitions. [2025-02-05 17:18:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:04,312 INFO L225 Difference]: With dead ends: 10291 [2025-02-05 17:18:04,313 INFO L226 Difference]: Without dead ends: 7652 [2025-02-05 17:18:04,324 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:18:04,326 INFO L435 NwaCegarLoop]: 4538 mSDtfsCounter, 4766 mSDsluCounter, 13653 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4782 SdHoareTripleChecker+Valid, 18191 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:04,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4782 Valid, 18191 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:18:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2025-02-05 17:18:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7477. [2025-02-05 17:18:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7477 states, 7013 states have (on average 1.6513617567374874) internal successors, (11581), 7081 states have internal predecessors, (11581), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-02-05 17:18:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 12425 transitions. [2025-02-05 17:18:04,615 INFO L78 Accepts]: Start accepts. Automaton has 7477 states and 12425 transitions. Word has length 134 [2025-02-05 17:18:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:04,615 INFO L471 AbstractCegarLoop]: Abstraction has 7477 states and 12425 transitions. [2025-02-05 17:18:04,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 7477 states and 12425 transitions. [2025-02-05 17:18:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:04,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:04,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:04,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:18:04,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:04,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1949558972, now seen corresponding path program 1 times [2025-02-05 17:18:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:04,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029893194] [2025-02-05 17:18:04,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:04,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:04,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:04,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:04,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:04,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:04,747 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:18:04,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029893194] [2025-02-05 17:18:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029893194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:04,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:04,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603445590] [2025-02-05 17:18:04,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:04,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:04,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:04,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:04,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:04,749 INFO L87 Difference]: Start difference. First operand 7477 states and 12425 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:05,557 INFO L93 Difference]: Finished difference Result 19162 states and 31698 transitions. [2025-02-05 17:18:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:05,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:05,633 INFO L225 Difference]: With dead ends: 19162 [2025-02-05 17:18:05,634 INFO L226 Difference]: Without dead ends: 13822 [2025-02-05 17:18:05,652 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:18:05,653 INFO L435 NwaCegarLoop]: 4535 mSDtfsCounter, 4761 mSDsluCounter, 13644 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 18179 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:05,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 18179 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:18:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-02-05 17:18:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13554. [2025-02-05 17:18:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6362118320610688) internal successors, (20577), 12790 states have internal predecessors, (20577), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:18:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22733 transitions. [2025-02-05 17:18:06,121 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22733 transitions. Word has length 134 [2025-02-05 17:18:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:06,121 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22733 transitions. [2025-02-05 17:18:06,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22733 transitions. [2025-02-05 17:18:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:06,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:06,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:06,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:18:06,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:06,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1826116037, now seen corresponding path program 1 times [2025-02-05 17:18:06,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088344993] [2025-02-05 17:18:06,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:06,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:06,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:06,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:06,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:06,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:06,284 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:18:06,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088344993] [2025-02-05 17:18:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088344993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:06,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991611492] [2025-02-05 17:18:06,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:06,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:06,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:06,285 INFO L87 Difference]: Start difference. First operand 13554 states and 22733 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:06,929 INFO L93 Difference]: Finished difference Result 27911 states and 47718 transitions. [2025-02-05 17:18:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:06,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:06,980 INFO L225 Difference]: With dead ends: 27911 [2025-02-05 17:18:06,980 INFO L226 Difference]: Without dead ends: 16494 [2025-02-05 17:18:07,006 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:18:07,007 INFO L435 NwaCegarLoop]: 4286 mSDtfsCounter, 4545 mSDsluCounter, 8458 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 12744 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:07,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 12744 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16494 states. [2025-02-05 17:18:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16494 to 13554. [2025-02-05 17:18:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.633587786259542) internal successors, (20544), 12790 states have internal predecessors, (20544), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:18:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22700 transitions. [2025-02-05 17:18:07,498 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22700 transitions. Word has length 134 [2025-02-05 17:18:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:07,499 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22700 transitions. [2025-02-05 17:18:07,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22700 transitions. [2025-02-05 17:18:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:07,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:07,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:18:07,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:07,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 839533348, now seen corresponding path program 1 times [2025-02-05 17:18:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:07,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404383822] [2025-02-05 17:18:07,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:07,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:07,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:07,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:07,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:07,602 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:18:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404383822] [2025-02-05 17:18:07,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404383822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:07,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050251349] [2025-02-05 17:18:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:07,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:07,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:07,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:07,604 INFO L87 Difference]: Start difference. First operand 13554 states and 22700 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:08,304 INFO L93 Difference]: Finished difference Result 27666 states and 47162 transitions. [2025-02-05 17:18:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:08,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:08,377 INFO L225 Difference]: With dead ends: 27666 [2025-02-05 17:18:08,380 INFO L226 Difference]: Without dead ends: 16249 [2025-02-05 17:18:08,429 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:18:08,430 INFO L435 NwaCegarLoop]: 4283 mSDtfsCounter, 4542 mSDsluCounter, 8453 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 12736 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:08,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4558 Valid, 12736 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16249 states. [2025-02-05 17:18:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16249 to 13554. [2025-02-05 17:18:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6309637404580153) internal successors, (20511), 12790 states have internal predecessors, (20511), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:18:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22667 transitions. [2025-02-05 17:18:09,110 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22667 transitions. Word has length 134 [2025-02-05 17:18:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:09,110 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22667 transitions. [2025-02-05 17:18:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22667 transitions. [2025-02-05 17:18:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:09,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:09,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:09,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:18:09,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:09,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1916086757, now seen corresponding path program 1 times [2025-02-05 17:18:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087480482] [2025-02-05 17:18:09,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:09,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:09,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:09,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:09,238 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:18:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087480482] [2025-02-05 17:18:09,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087480482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:09,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:09,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183020729] [2025-02-05 17:18:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:09,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:09,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:09,240 INFO L87 Difference]: Start difference. First operand 13554 states and 22667 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:10,573 INFO L93 Difference]: Finished difference Result 40825 states and 69395 transitions. [2025-02-05 17:18:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:10,690 INFO L225 Difference]: With dead ends: 40825 [2025-02-05 17:18:10,690 INFO L226 Difference]: Without dead ends: 29408 [2025-02-05 17:18:10,724 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:18:10,725 INFO L435 NwaCegarLoop]: 4520 mSDtfsCounter, 4994 mSDsluCounter, 13596 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5019 SdHoareTripleChecker+Valid, 18116 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:10,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5019 Valid, 18116 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:18:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29408 states. [2025-02-05 17:18:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29408 to 26989. [2025-02-05 17:18:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.634691988894701) internal successors, (40627), 25521 states have internal predecessors, (40627), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-02-05 17:18:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46879 transitions. [2025-02-05 17:18:11,753 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46879 transitions. Word has length 134 [2025-02-05 17:18:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:11,753 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46879 transitions. [2025-02-05 17:18:11,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46879 transitions. [2025-02-05 17:18:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:11,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:11,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:11,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:18:11,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:11,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash -543037692, now seen corresponding path program 1 times [2025-02-05 17:18:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:11,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854345249] [2025-02-05 17:18:11,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:11,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:11,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:11,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:11,856 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:18:11,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:11,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854345249] [2025-02-05 17:18:11,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854345249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:11,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:11,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:11,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611153557] [2025-02-05 17:18:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:11,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:11,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:11,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:11,858 INFO L87 Difference]: Start difference. First operand 26989 states and 46879 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:13,080 INFO L93 Difference]: Finished difference Result 58420 states and 104966 transitions. [2025-02-05 17:18:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:13,205 INFO L225 Difference]: With dead ends: 58420 [2025-02-05 17:18:13,205 INFO L226 Difference]: Without dead ends: 33568 [2025-02-05 17:18:13,252 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:18:13,254 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4536 mSDsluCounter, 8442 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4552 SdHoareTripleChecker+Valid, 12720 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:13,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4552 Valid, 12720 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33568 states. [2025-02-05 17:18:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33568 to 26989. [2025-02-05 17:18:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.632076610469561) internal successors, (40562), 25521 states have internal predecessors, (40562), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-02-05 17:18:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46814 transitions. [2025-02-05 17:18:14,677 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46814 transitions. Word has length 134 [2025-02-05 17:18:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:14,678 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46814 transitions. [2025-02-05 17:18:14,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46814 transitions. [2025-02-05 17:18:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:14,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:14,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:14,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:18:14,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:14,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:14,690 INFO L85 PathProgramCache]: Analyzing trace with hash -483816955, now seen corresponding path program 1 times [2025-02-05 17:18:14,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:14,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617747085] [2025-02-05 17:18:14,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:14,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:14,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:14,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:14,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:14,821 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:18:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:14,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617747085] [2025-02-05 17:18:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617747085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299600715] [2025-02-05 17:18:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:14,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:14,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:14,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:14,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:14,823 INFO L87 Difference]: Start difference. First operand 26989 states and 46814 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:17,072 INFO L93 Difference]: Finished difference Result 85774 states and 155330 transitions. [2025-02-05 17:18:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:17,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:17,304 INFO L225 Difference]: With dead ends: 85774 [2025-02-05 17:18:17,305 INFO L226 Difference]: Without dead ends: 60922 [2025-02-05 17:18:17,376 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:18:17,377 INFO L435 NwaCegarLoop]: 4512 mSDtfsCounter, 4921 mSDsluCounter, 13573 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4946 SdHoareTripleChecker+Valid, 18085 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:17,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4946 Valid, 18085 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:18:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60922 states. [2025-02-05 17:18:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60922 to 57165. [2025-02-05 17:18:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6452668439885954) internal successors, (85980), 54321 states have internal predecessors, (85980), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-02-05 17:18:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106504 transitions. [2025-02-05 17:18:20,368 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106504 transitions. Word has length 134 [2025-02-05 17:18:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:20,369 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106504 transitions. [2025-02-05 17:18:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106504 transitions. [2025-02-05 17:18:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:20,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:20,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:20,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:18:20,389 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:20,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash 210830052, now seen corresponding path program 1 times [2025-02-05 17:18:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145150880] [2025-02-05 17:18:20,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:20,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:20,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:20,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:20,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:20,693 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:18:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:20,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145150880] [2025-02-05 17:18:20,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145150880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:20,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:20,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53462482] [2025-02-05 17:18:20,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:20,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:20,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:20,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:20,696 INFO L87 Difference]: Start difference. First operand 57165 states and 106504 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:23,470 INFO L93 Difference]: Finished difference Result 127516 states and 249746 transitions. [2025-02-05 17:18:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:23,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:23,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:23,801 INFO L225 Difference]: With dead ends: 127516 [2025-02-05 17:18:23,801 INFO L226 Difference]: Without dead ends: 72488 [2025-02-05 17:18:23,956 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:18:23,956 INFO L435 NwaCegarLoop]: 4260 mSDtfsCounter, 4543 mSDsluCounter, 8420 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4559 SdHoareTripleChecker+Valid, 12680 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:23,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4559 Valid, 12680 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72488 states. [2025-02-05 17:18:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72488 to 57165. [2025-02-05 17:18:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6427983696588147) internal successors, (85851), 54321 states have internal predecessors, (85851), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-02-05 17:18:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106375 transitions. [2025-02-05 17:18:29,270 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106375 transitions. Word has length 134 [2025-02-05 17:18:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:29,271 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106375 transitions. [2025-02-05 17:18:29,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106375 transitions. [2025-02-05 17:18:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:29,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:29,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:29,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:18:29,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:29,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1341616677, now seen corresponding path program 1 times [2025-02-05 17:18:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:29,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450880537] [2025-02-05 17:18:29,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:29,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:29,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:29,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:29,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:29,363 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:18:29,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450880537] [2025-02-05 17:18:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450880537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042467850] [2025-02-05 17:18:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:29,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:29,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:29,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:29,365 INFO L87 Difference]: Start difference. First operand 57165 states and 106375 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:31,921 INFO L93 Difference]: Finished difference Result 125327 states and 245110 transitions. [2025-02-05 17:18:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2025-02-05 17:18:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:32,213 INFO L225 Difference]: With dead ends: 125327 [2025-02-05 17:18:32,213 INFO L226 Difference]: Without dead ends: 70299 [2025-02-05 17:18:32,364 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:18:32,365 INFO L435 NwaCegarLoop]: 4270 mSDtfsCounter, 4529 mSDsluCounter, 8428 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 12698 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:32,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4545 Valid, 12698 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70299 states. [2025-02-05 17:18:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70299 to 57165. [2025-02-05 17:18:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6403298953290342) internal successors, (85722), 54321 states have internal predecessors, (85722), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-02-05 17:18:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106246 transitions. [2025-02-05 17:18:35,632 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106246 transitions. Word has length 134 [2025-02-05 17:18:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:35,632 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106246 transitions. [2025-02-05 17:18:35,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106246 transitions. [2025-02-05 17:18:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:18:35,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:35,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:18:35,648 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:35,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash 408262340, now seen corresponding path program 1 times [2025-02-05 17:18:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816166369] [2025-02-05 17:18:35,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:35,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:18:35,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:18:35,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:35,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:35,743 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:18:35,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:35,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816166369] [2025-02-05 17:18:35,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816166369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:35,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:35,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:35,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535790045] [2025-02-05 17:18:35,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:35,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:35,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:35,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:35,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:35,744 INFO L87 Difference]: Start difference. First operand 57165 states and 106246 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)