./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.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_label46+token_ring.10.cil-2.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 24feb2eb47843fcae857e84ddd5aa58dae94843db909f56f0ca240268764bef9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:15:34,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:15:34,874 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:15:34,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:15:34,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:15:34,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:15:34,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:15:34,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:15:34,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:15:34,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:15:34,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:15:34,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:15:34,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:15:34,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:15:34,892 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:15:34,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:15:34,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:15:34,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:15:34,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:15:34,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:15:34,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:15:34,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:15:34,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:15:34,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:15:34,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:15:34,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:15:34,895 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 -> 24feb2eb47843fcae857e84ddd5aa58dae94843db909f56f0ca240268764bef9 [2025-02-05 17:15:35,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:15:35,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:15:35,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:15:35,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:15:35,075 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:15:35,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c [2025-02-05 17:15:36,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/953cffb8a/53bb80c517fc4553a3a23e53e6ad1c77/FLAGd940f3d01 [2025-02-05 17:15:36,919 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:15:36,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c [2025-02-05 17:15:36,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/953cffb8a/53bb80c517fc4553a3a23e53e6ad1c77/FLAGd940f3d01 [2025-02-05 17:15:37,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/953cffb8a/53bb80c517fc4553a3a23e53e6ad1c77 [2025-02-05 17:15:37,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:15:37,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:15:37,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:15:37,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:15:37,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:15:37,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:15:37" (1/1) ... [2025-02-05 17:15:37,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65eb6918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:37, skipping insertion in model container [2025-02-05 17:15:37,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:15:37" (1/1) ... [2025-02-05 17:15:37,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:15:38,995 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_label46+token_ring.10.cil-2.c[382357,382370] [2025-02-05 17:15:39,032 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_label46+token_ring.10.cil-2.c[383339,383352] [2025-02-05 17:15:39,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:15:39,309 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:15:39,817 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_label46+token_ring.10.cil-2.c[382357,382370] [2025-02-05 17:15:39,821 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_label46+token_ring.10.cil-2.c[383339,383352] [2025-02-05 17:15:39,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:15:39,893 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:15:39,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39 WrapperNode [2025-02-05 17:15:39,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:15:39,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:15:39,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:15:39,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:15:39,900 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:15:39" (1/1) ... [2025-02-05 17:15:39,962 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:15:39" (1/1) ... [2025-02-05 17:15:40,251 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-02-05 17:15:40,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:15:40,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:15:40,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:15:40,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:15:40,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,393 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:15:40,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:15:40,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:15:40,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:15:40,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:15:40,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (1/1) ... [2025-02-05 17:15:40,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:15:40,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:15:40,763 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:15:40,772 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:15:40,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:15:40,790 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:15:40,790 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:15:40,790 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:15:40,790 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:15:40,790 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:15:40,790 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:15:40,790 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:15:40,790 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:15:40,790 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:15:40,790 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:15:40,790 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:15:40,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:15:40,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:15:40,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:15:40,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:15:40,883 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:15:40,885 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:15:47,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:15:47,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:15:47,261 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:15:47,261 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:15:47,261 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:15:47,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:15:47,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:15:47,553 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2025-02-05 17:15:47,553 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:15:47,603 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:15:47,603 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:15:47,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:15:47 BoogieIcfgContainer [2025-02-05 17:15:47,604 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:15:47,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:15:47,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:15:47,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:15:47,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:15:37" (1/3) ... [2025-02-05 17:15:47,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57db9d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:15:47, skipping insertion in model container [2025-02-05 17:15:47,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:39" (2/3) ... [2025-02-05 17:15:47,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57db9d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:15:47, skipping insertion in model container [2025-02-05 17:15:47,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:15:47" (3/3) ... [2025-02-05 17:15:47,613 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.10.cil-2.c [2025-02-05 17:15:47,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:15:47,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.10.cil-2.c that has 7 procedures, 2537 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-02-05 17:15:47,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:15:47,744 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;@7b2df1e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:15:47,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:15:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 2537 states, 2504 states have (on average 1.832667731629393) internal successors, (4589), 2507 states have internal predecessors, (4589), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 17:15:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:47,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:47,773 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, 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:15:47,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 490995444, now seen corresponding path program 1 times [2025-02-05 17:15:47,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:47,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211216264] [2025-02-05 17:15:47,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:47,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:47,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:47,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:47,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:48,388 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:15:48,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211216264] [2025-02-05 17:15:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211216264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:48,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:48,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862806810] [2025-02-05 17:15:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:48,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:48,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:48,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:48,417 INFO L87 Difference]: Start difference. First operand has 2537 states, 2504 states have (on average 1.832667731629393) internal successors, (4589), 2507 states have internal predecessors, (4589), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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:15:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:49,130 INFO L93 Difference]: Finished difference Result 5430 states and 9845 transitions. [2025-02-05 17:15:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:15:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:49,160 INFO L225 Difference]: With dead ends: 5430 [2025-02-05 17:15:49,160 INFO L226 Difference]: Without dead ends: 2841 [2025-02-05 17:15:49,173 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:15:49,175 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 5028 mSDsluCounter, 9139 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5046 SdHoareTripleChecker+Valid, 13587 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:49,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 13587 Invalid, 602 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:15:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2025-02-05 17:15:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2816. [2025-02-05 17:15:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2758 states have (on average 1.7915155910079767) internal successors, (4941), 2761 states have internal predecessors, (4941), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:15:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5028 transitions. [2025-02-05 17:15:49,324 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5028 transitions. Word has length 156 [2025-02-05 17:15:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:49,325 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5028 transitions. [2025-02-05 17:15:49,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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:15:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5028 transitions. [2025-02-05 17:15:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:49,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:49,330 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, 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:15:49,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:15:49,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:49,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:49,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1402295606, now seen corresponding path program 1 times [2025-02-05 17:15:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:49,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662055309] [2025-02-05 17:15:49,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:49,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:49,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:49,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:49,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:49,507 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:15:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662055309] [2025-02-05 17:15:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662055309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028254273] [2025-02-05 17:15:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:49,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:49,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:49,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:49,509 INFO L87 Difference]: Start difference. First operand 2816 states and 5028 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:15:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:49,849 INFO L93 Difference]: Finished difference Result 3559 states and 6197 transitions. [2025-02-05 17:15:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:49,862 INFO L225 Difference]: With dead ends: 3559 [2025-02-05 17:15:49,862 INFO L226 Difference]: Without dead ends: 2882 [2025-02-05 17:15:49,865 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:15:49,866 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4675 mSDsluCounter, 8599 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 12966 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:49,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 12966 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-02-05 17:15:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2816. [2025-02-05 17:15:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2758 states have (on average 1.7907904278462654) internal successors, (4939), 2761 states have internal predecessors, (4939), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:15:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5026 transitions. [2025-02-05 17:15:49,948 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5026 transitions. Word has length 156 [2025-02-05 17:15:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:49,949 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5026 transitions. [2025-02-05 17:15:49,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:15:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5026 transitions. [2025-02-05 17:15:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:49,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:49,953 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, 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:15:49,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:15:49,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:49,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:49,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1553908267, now seen corresponding path program 1 times [2025-02-05 17:15:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:49,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872272111] [2025-02-05 17:15:49,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:49,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:49,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:49,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:49,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:50,181 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:15:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872272111] [2025-02-05 17:15:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872272111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028619739] [2025-02-05 17:15:50,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:50,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:50,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:50,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:50,183 INFO L87 Difference]: Start difference. First operand 2816 states and 5026 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:50,917 INFO L93 Difference]: Finished difference Result 3924 states and 6758 transitions. [2025-02-05 17:15:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:50,932 INFO L225 Difference]: With dead ends: 3924 [2025-02-05 17:15:50,932 INFO L226 Difference]: Without dead ends: 3247 [2025-02-05 17:15:50,935 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:15:50,935 INFO L435 NwaCegarLoop]: 4666 mSDtfsCounter, 4959 mSDsluCounter, 14059 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4977 SdHoareTripleChecker+Valid, 18725 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:50,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4977 Valid, 18725 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:15:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2025-02-05 17:15:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 3138. [2025-02-05 17:15:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 3054 states have (on average 1.7635887360838245) internal successors, (5386), 3058 states have internal predecessors, (5386), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-02-05 17:15:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 5514 transitions. [2025-02-05 17:15:51,023 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 5514 transitions. Word has length 156 [2025-02-05 17:15:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:51,023 INFO L471 AbstractCegarLoop]: Abstraction has 3138 states and 5514 transitions. [2025-02-05 17:15:51,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 5514 transitions. [2025-02-05 17:15:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:51,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:51,026 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, 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:15:51,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:15:51,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1372175018, now seen corresponding path program 1 times [2025-02-05 17:15:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912852005] [2025-02-05 17:15:51,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:51,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:51,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:51,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:51,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:51,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:51,269 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:15:51,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:51,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912852005] [2025-02-05 17:15:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912852005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:51,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:51,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:51,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759297777] [2025-02-05 17:15:51,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:51,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:51,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:51,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:51,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:51,271 INFO L87 Difference]: Start difference. First operand 3138 states and 5514 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:51,973 INFO L93 Difference]: Finished difference Result 4945 states and 8331 transitions. [2025-02-05 17:15:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:51,993 INFO L225 Difference]: With dead ends: 4945 [2025-02-05 17:15:51,993 INFO L226 Difference]: Without dead ends: 3946 [2025-02-05 17:15:51,998 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:15:52,000 INFO L435 NwaCegarLoop]: 4409 mSDtfsCounter, 4982 mSDsluCounter, 13431 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5000 SdHoareTripleChecker+Valid, 17840 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:52,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5000 Valid, 17840 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:15:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2025-02-05 17:15:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3821. [2025-02-05 17:15:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3683 states have (on average 1.7244094488188977) internal successors, (6351), 3691 states have internal predecessors, (6351), 100 states have call successors, (100), 30 states have call predecessors, (100), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-02-05 17:15:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 6567 transitions. [2025-02-05 17:15:52,131 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 6567 transitions. Word has length 156 [2025-02-05 17:15:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:52,131 INFO L471 AbstractCegarLoop]: Abstraction has 3821 states and 6567 transitions. [2025-02-05 17:15:52,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 6567 transitions. [2025-02-05 17:15:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:52,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:52,135 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, 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:15:52,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:15:52,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:52,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1227765323, now seen corresponding path program 1 times [2025-02-05 17:15:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808650734] [2025-02-05 17:15:52,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:52,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:52,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:52,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:52,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:52,279 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:15:52,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:52,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808650734] [2025-02-05 17:15:52,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808650734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:52,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:52,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:52,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656350356] [2025-02-05 17:15:52,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:52,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:52,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:52,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:52,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:52,281 INFO L87 Difference]: Start difference. First operand 3821 states and 6567 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:53,120 INFO L93 Difference]: Finished difference Result 7138 states and 11782 transitions. [2025-02-05 17:15:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:53,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:53,142 INFO L225 Difference]: With dead ends: 7138 [2025-02-05 17:15:53,142 INFO L226 Difference]: Without dead ends: 5456 [2025-02-05 17:15:53,150 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:15:53,150 INFO L435 NwaCegarLoop]: 4659 mSDtfsCounter, 4949 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4967 SdHoareTripleChecker+Valid, 18697 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:53,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4967 Valid, 18697 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:15:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2025-02-05 17:15:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5298. [2025-02-05 17:15:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5046 states have (on average 1.6811335711454618) internal successors, (8483), 5068 states have internal predecessors, (8483), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-02-05 17:15:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 8899 transitions. [2025-02-05 17:15:53,315 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 8899 transitions. Word has length 156 [2025-02-05 17:15:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:53,315 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 8899 transitions. [2025-02-05 17:15:53,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 8899 transitions. [2025-02-05 17:15:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:53,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:53,319 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, 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:15:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:15:53,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:53,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1500201610, now seen corresponding path program 1 times [2025-02-05 17:15:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542800562] [2025-02-05 17:15:53,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:53,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:53,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:53,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:53,461 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:15:53,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:53,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542800562] [2025-02-05 17:15:53,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542800562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:53,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:53,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:53,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671794138] [2025-02-05 17:15:53,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:53,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:53,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:53,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:53,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:53,465 INFO L87 Difference]: Start difference. First operand 5298 states and 8899 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:54,320 INFO L93 Difference]: Finished difference Result 11949 states and 19576 transitions. [2025-02-05 17:15:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:54,366 INFO L225 Difference]: With dead ends: 11949 [2025-02-05 17:15:54,367 INFO L226 Difference]: Without dead ends: 8790 [2025-02-05 17:15:54,380 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:15:54,380 INFO L435 NwaCegarLoop]: 4656 mSDtfsCounter, 4944 mSDsluCounter, 14029 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4962 SdHoareTripleChecker+Valid, 18685 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:54,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4962 Valid, 18685 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:15:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2025-02-05 17:15:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8567. [2025-02-05 17:15:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8567 states, 8069 states have (on average 1.6506382451357045) internal successors, (13319), 8137 states have internal predecessors, (13319), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-02-05 17:15:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 14231 transitions. [2025-02-05 17:15:54,738 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 14231 transitions. Word has length 156 [2025-02-05 17:15:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:54,738 INFO L471 AbstractCegarLoop]: Abstraction has 8567 states and 14231 transitions. [2025-02-05 17:15:54,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 14231 transitions. [2025-02-05 17:15:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:54,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:54,744 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, 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:15:54,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:15:54,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:54,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash 984862101, now seen corresponding path program 1 times [2025-02-05 17:15:54,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:54,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544927443] [2025-02-05 17:15:54,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:54,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:54,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:54,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:54,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:54,876 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:15:54,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544927443] [2025-02-05 17:15:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544927443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833905861] [2025-02-05 17:15:54,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:54,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:54,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:54,879 INFO L87 Difference]: Start difference. First operand 8567 states and 14231 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:55,696 INFO L93 Difference]: Finished difference Result 22772 states and 37818 transitions. [2025-02-05 17:15:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:55,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:55,745 INFO L225 Difference]: With dead ends: 22772 [2025-02-05 17:15:55,746 INFO L226 Difference]: Without dead ends: 16344 [2025-02-05 17:15:55,772 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:15:55,773 INFO L435 NwaCegarLoop]: 4653 mSDtfsCounter, 4939 mSDsluCounter, 14020 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4957 SdHoareTripleChecker+Valid, 18673 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:55,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4957 Valid, 18673 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:15:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2025-02-05 17:15:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 15996. [2025-02-05 17:15:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6454654895666132) internal successors, (24603), 15166 states have internal predecessors, (24603), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:15:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26891 transitions. [2025-02-05 17:15:56,216 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26891 transitions. Word has length 156 [2025-02-05 17:15:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:56,216 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26891 transitions. [2025-02-05 17:15:56,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:15:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26891 transitions. [2025-02-05 17:15:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:56,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:56,223 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, 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:15:56,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:15:56,223 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:56,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 510836118, now seen corresponding path program 1 times [2025-02-05 17:15:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:56,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380434218] [2025-02-05 17:15:56,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:56,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:56,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:56,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:56,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:56,324 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:15:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380434218] [2025-02-05 17:15:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380434218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:56,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898739528] [2025-02-05 17:15:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:56,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:56,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:56,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:56,328 INFO L87 Difference]: Start difference. First operand 15996 states and 26891 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:15:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:56,930 INFO L93 Difference]: Finished difference Result 33773 states and 57990 transitions. [2025-02-05 17:15:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:56,993 INFO L225 Difference]: With dead ends: 33773 [2025-02-05 17:15:56,994 INFO L226 Difference]: Without dead ends: 19916 [2025-02-05 17:15:57,027 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:15:57,031 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4667 mSDsluCounter, 8574 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 12928 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:57,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 12928 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19916 states. [2025-02-05 17:15:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19916 to 15996. [2025-02-05 17:15:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6432584269662922) internal successors, (24570), 15166 states have internal predecessors, (24570), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:15:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26858 transitions. [2025-02-05 17:15:57,695 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26858 transitions. Word has length 156 [2025-02-05 17:15:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:57,696 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26858 transitions. [2025-02-05 17:15:57,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:15:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26858 transitions. [2025-02-05 17:15:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:57,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:57,702 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, 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:15:57,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:15:57,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:57,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:57,703 INFO L85 PathProgramCache]: Analyzing trace with hash 218450293, now seen corresponding path program 1 times [2025-02-05 17:15:57,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:57,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277489555] [2025-02-05 17:15:57,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:57,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:57,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:57,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:57,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:57,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:57,803 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:15:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277489555] [2025-02-05 17:15:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277489555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:57,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:57,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821053857] [2025-02-05 17:15:57,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:57,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:57,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:57,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:57,805 INFO L87 Difference]: Start difference. First operand 15996 states and 26858 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:15:58,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:58,343 INFO L93 Difference]: Finished difference Result 33528 states and 57434 transitions. [2025-02-05 17:15:58,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:58,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:15:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:58,411 INFO L225 Difference]: With dead ends: 33528 [2025-02-05 17:15:58,411 INFO L226 Difference]: Without dead ends: 19671 [2025-02-05 17:15:58,444 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:15:58,447 INFO L435 NwaCegarLoop]: 4351 mSDtfsCounter, 4664 mSDsluCounter, 8569 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 12920 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:58,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 12920 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2025-02-05 17:15:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 15996. [2025-02-05 17:15:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6410513643659712) internal successors, (24537), 15166 states have internal predecessors, (24537), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:15:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26825 transitions. [2025-02-05 17:15:58,989 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26825 transitions. Word has length 156 [2025-02-05 17:15:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:58,989 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26825 transitions. [2025-02-05 17:15:58,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:15:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26825 transitions. [2025-02-05 17:15:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:15:58,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:58,996 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, 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:15:58,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:15:58,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:58,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2146286154, now seen corresponding path program 1 times [2025-02-05 17:15:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632504829] [2025-02-05 17:15:58,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:59,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:15:59,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:15:59,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:59,192 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:15:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632504829] [2025-02-05 17:15:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632504829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474431581] [2025-02-05 17:15:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:59,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:59,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:59,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:59,194 INFO L87 Difference]: Start difference. First operand 15996 states and 26825 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:16:00,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:00,728 INFO L93 Difference]: Finished difference Result 47251 states and 81018 transitions. [2025-02-05 17:16:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:00,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:16:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:00,900 INFO L225 Difference]: With dead ends: 47251 [2025-02-05 17:16:00,900 INFO L226 Difference]: Without dead ends: 33394 [2025-02-05 17:16:00,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:16:00,952 INFO L435 NwaCegarLoop]: 4640 mSDtfsCounter, 4918 mSDsluCounter, 13983 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 18623 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:00,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 18623 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:16:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33394 states. [2025-02-05 17:16:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33394 to 32879. [2025-02-05 17:16:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32879 states, 30581 states have (on average 1.6542624505411858) internal successors, (50589), 31249 states have internal predecessors, (50589), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:16:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57165 transitions. [2025-02-05 17:16:02,142 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57165 transitions. Word has length 156 [2025-02-05 17:16:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:02,142 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57165 transitions. [2025-02-05 17:16:02,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:16:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57165 transitions. [2025-02-05 17:16:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:16:02,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:02,153 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, 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:16:02,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:16:02,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:02,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1933851989, now seen corresponding path program 1 times [2025-02-05 17:16:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:02,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051231396] [2025-02-05 17:16:02,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:02,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:16:02,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:16:02,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:02,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:02,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:16:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:02,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051231396] [2025-02-05 17:16:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051231396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:02,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:02,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261510177] [2025-02-05 17:16:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:02,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:02,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:02,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:02,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:02,240 INFO L87 Difference]: Start difference. First operand 32879 states and 57165 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:16:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:03,383 INFO L93 Difference]: Finished difference Result 73122 states and 131382 transitions. [2025-02-05 17:16:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:03,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:16:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:03,574 INFO L225 Difference]: With dead ends: 73122 [2025-02-05 17:16:03,574 INFO L226 Difference]: Without dead ends: 42382 [2025-02-05 17:16:03,678 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:16:03,679 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4660 mSDsluCounter, 8560 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4678 SdHoareTripleChecker+Valid, 12906 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:03,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4678 Valid, 12906 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:16:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42382 states. [2025-02-05 17:16:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42382 to 32879. [2025-02-05 17:16:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32879 states, 30581 states have (on average 1.652136947778032) internal successors, (50524), 31249 states have internal predecessors, (50524), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:16:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57100 transitions. [2025-02-05 17:16:05,975 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57100 transitions. Word has length 156 [2025-02-05 17:16:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:05,975 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57100 transitions. [2025-02-05 17:16:05,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:16:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57100 transitions. [2025-02-05 17:16:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:16:05,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:05,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:05,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:16:05,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:05,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash -566929962, now seen corresponding path program 1 times [2025-02-05 17:16:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:05,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175975296] [2025-02-05 17:16:05,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:05,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:16:06,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:16:06,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:06,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:06,104 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:16:06,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175975296] [2025-02-05 17:16:06,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175975296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:06,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:06,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:06,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244003143] [2025-02-05 17:16:06,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:06,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:06,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:06,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:06,105 INFO L87 Difference]: Start difference. First operand 32879 states and 57100 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:16:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:08,744 INFO L93 Difference]: Finished difference Result 108360 states and 195178 transitions. [2025-02-05 17:16:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:16:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:09,021 INFO L225 Difference]: With dead ends: 108360 [2025-02-05 17:16:09,021 INFO L226 Difference]: Without dead ends: 77620 [2025-02-05 17:16:09,109 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:16:09,110 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 5258 mSDsluCounter, 13365 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 17756 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:09,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 17756 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:16:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77620 states. [2025-02-05 17:16:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77620 to 71799. [2025-02-05 17:16:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71799 states, 66571 states have (on average 1.6769764612218534) internal successors, (111638), 68633 states have internal predecessors, (111638), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:16:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132806 transitions. [2025-02-05 17:16:11,641 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132806 transitions. Word has length 156 [2025-02-05 17:16:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:11,643 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132806 transitions. [2025-02-05 17:16:11,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:16:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132806 transitions. [2025-02-05 17:16:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:16:11,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:11,659 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, 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:16:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:16:11,659 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash -93411019, now seen corresponding path program 1 times [2025-02-05 17:16:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469707238] [2025-02-05 17:16:11,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:11,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:16:11,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:16:11,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:11,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:11,974 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:16:11,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469707238] [2025-02-05 17:16:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469707238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:11,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713972464] [2025-02-05 17:16:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:11,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:11,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:11,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:11,978 INFO L87 Difference]: Start difference. First operand 71799 states and 132806 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:16:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:15,343 INFO L93 Difference]: Finished difference Result 165538 states and 319858 transitions. [2025-02-05 17:16:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:16:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:15,832 INFO L225 Difference]: With dead ends: 165538 [2025-02-05 17:16:15,833 INFO L226 Difference]: Without dead ends: 95878 [2025-02-05 17:16:15,958 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:16:15,959 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4654 mSDsluCounter, 8549 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 12890 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:15,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 12890 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:16:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95878 states. [2025-02-05 17:16:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95878 to 71799. [2025-02-05 17:16:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71799 states, 66571 states have (on average 1.675038680506527) internal successors, (111509), 68633 states have internal predecessors, (111509), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:16:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132677 transitions. [2025-02-05 17:16:20,663 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132677 transitions. Word has length 156 [2025-02-05 17:16:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:20,664 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132677 transitions. [2025-02-05 17:16:20,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:16:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132677 transitions. [2025-02-05 17:16:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 17:16:20,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:20,681 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, 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:16:20,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:16:20,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:20,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash 337505782, now seen corresponding path program 1 times [2025-02-05 17:16:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177255186] [2025-02-05 17:16:20,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:20,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 17:16:20,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 17:16:20,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:20,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:20,770 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:16:20,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:20,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177255186] [2025-02-05 17:16:20,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177255186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:20,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:20,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:20,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178683370] [2025-02-05 17:16:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:20,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:20,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:20,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:20,773 INFO L87 Difference]: Start difference. First operand 71799 states and 132677 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:16:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:26,516 INFO L93 Difference]: Finished difference Result 241756 states and 474039 transitions. [2025-02-05 17:16:26,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:26,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-02-05 17:16:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:27,257 INFO L225 Difference]: With dead ends: 241756 [2025-02-05 17:16:27,257 INFO L226 Difference]: Without dead ends: 172096 [2025-02-05 17:16:27,509 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:16:27,509 INFO L435 NwaCegarLoop]: 4622 mSDtfsCounter, 5146 mSDsluCounter, 13926 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5175 SdHoareTripleChecker+Valid, 18548 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:27,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5175 Valid, 18548 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:16:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172096 states.