./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ead4d47009bf2f1ade65f6eacfdab211d65347e20b879f4822b8ceaab9ef42cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:48:59,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:48:59,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:48:59,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:48:59,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:48:59,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:48:59,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:48:59,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:48:59,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:48:59,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:48:59,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:48:59,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:48:59,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:48:59,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:48:59,087 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:48:59,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:48:59,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:48:59,088 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ead4d47009bf2f1ade65f6eacfdab211d65347e20b879f4822b8ceaab9ef42cd [2025-03-03 15:48:59,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:48:59,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:48:59,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:48:59,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:48:59,309 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:48:59,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c [2025-03-03 15:49:00,443 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37de114de/296555585c504e0b9c18898b42f9c4e0/FLAG1d8abc001 [2025-03-03 15:49:00,917 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:49:00,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c [2025-03-03 15:49:00,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37de114de/296555585c504e0b9c18898b42f9c4e0/FLAG1d8abc001 [2025-03-03 15:49:01,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37de114de/296555585c504e0b9c18898b42f9c4e0 [2025-03-03 15:49:01,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:49:01,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:49:01,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:49:01,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:49:01,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:49:01,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:49:01" (1/1) ... [2025-03-03 15:49:01,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164417e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:01, skipping insertion in model container [2025-03-03 15:49:01,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:49:01" (1/1) ... [2025-03-03 15:49:01,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:49:02,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c[380593,380606] [2025-03-03 15:49:02,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c[383339,383352] [2025-03-03 15:49:02,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:49:02,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:49:03,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c[380593,380606] [2025-03-03 15:49:03,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c[383339,383352] [2025-03-03 15:49:03,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:49:03,072 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:49:03,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03 WrapperNode [2025-03-03 15:49:03,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:49:03,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:49:03,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:49:03,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:49:03,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,477 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-03-03 15:49:03,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:49:03,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:49:03,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:49:03,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:49:03,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,633 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:49:03,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:49:03,989 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:49:03,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:49:03,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:49:03,990 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (1/1) ... [2025-03-03 15:49:03,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:49:04,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:49:04,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:49:04,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:49:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:49:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:49:04,035 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:49:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:49:04,036 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:49:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:49:04,036 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:49:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:49:04,036 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:49:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:49:04,036 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:49:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:49:04,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:49:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:49:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:49:04,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:49:04,133 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:49:04,135 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:49:10,292 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:49:10,293 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:49:10,293 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:49:10,293 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:49:10,294 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:49:10,294 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:49:10,294 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:49:10,499 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2025-03-03 15:49:10,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:49:10,560 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:49:10,561 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:49:10,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:49:10 BoogieIcfgContainer [2025-03-03 15:49:10,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:49:10,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:49:10,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:49:10,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:49:10,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:49:01" (1/3) ... [2025-03-03 15:49:10,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575d88f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:49:10, skipping insertion in model container [2025-03-03 15:49:10,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:49:03" (2/3) ... [2025-03-03 15:49:10,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575d88f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:49:10, skipping insertion in model container [2025-03-03 15:49:10,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:49:10" (3/3) ... [2025-03-03 15:49:10,571 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.10.cil-2.c [2025-03-03 15:49:10,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:49:10,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.10.cil-2.c that has 7 procedures, 2537 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-03-03 15:49:10,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:49:10,711 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;@7835ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:49:10,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:49:10,723 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-03-03 15:49:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:10,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:10,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:10,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:10,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 490995444, now seen corresponding path program 1 times [2025-03-03 15:49:10,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:10,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834927952] [2025-03-03 15:49:10,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:10,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:10,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:10,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:10,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:10,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:11,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:11,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834927952] [2025-03-03 15:49:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834927952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:11,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:11,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269601041] [2025-03-03 15:49:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:11,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:11,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:11,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:11,262 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-03-03 15:49:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:12,032 INFO L93 Difference]: Finished difference Result 5430 states and 9845 transitions. [2025-03-03 15:49:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:49:12,034 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-03-03 15:49:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:12,057 INFO L225 Difference]: With dead ends: 5430 [2025-03-03 15:49:12,057 INFO L226 Difference]: Without dead ends: 2841 [2025-03-03 15:49:12,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:12,069 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-03-03 15:49:12,069 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-03-03 15:49:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2025-03-03 15:49:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2816. [2025-03-03 15:49:12,187 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-03-03 15:49:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5028 transitions. [2025-03-03 15:49:12,205 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5028 transitions. Word has length 156 [2025-03-03 15:49:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:12,205 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5028 transitions. [2025-03-03 15:49:12,205 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-03-03 15:49:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5028 transitions. [2025-03-03 15:49:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:12,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:12,208 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-03-03 15:49:12,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:49:12,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1402295606, now seen corresponding path program 1 times [2025-03-03 15:49:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913924851] [2025-03-03 15:49:12,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:12,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:12,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:12,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:12,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913924851] [2025-03-03 15:49:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913924851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:12,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343774850] [2025-03-03 15:49:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:12,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:12,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:12,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:12,433 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-03-03 15:49:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:12,788 INFO L93 Difference]: Finished difference Result 3559 states and 6197 transitions. [2025-03-03 15:49:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:12,789 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-03-03 15:49:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:12,801 INFO L225 Difference]: With dead ends: 3559 [2025-03-03 15:49:12,802 INFO L226 Difference]: Without dead ends: 2882 [2025-03-03 15:49:12,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:12,806 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:12,806 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.3s Time] [2025-03-03 15:49:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-03-03 15:49:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2816. [2025-03-03 15:49:12,861 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-03-03 15:49:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5026 transitions. [2025-03-03 15:49:12,874 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5026 transitions. Word has length 156 [2025-03-03 15:49:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:12,874 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5026 transitions. [2025-03-03 15:49:12,874 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-03-03 15:49:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5026 transitions. [2025-03-03 15:49:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:12,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:12,876 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-03-03 15:49:12,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:49:12,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:12,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1553908267, now seen corresponding path program 1 times [2025-03-03 15:49:12,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:12,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817042317] [2025-03-03 15:49:12,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:12,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:12,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:12,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:12,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:13,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817042317] [2025-03-03 15:49:13,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817042317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:13,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:13,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188747229] [2025-03-03 15:49:13,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:13,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:13,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:13,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:13,066 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-03-03 15:49:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:14,012 INFO L93 Difference]: Finished difference Result 3924 states and 6758 transitions. [2025-03-03 15:49:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:14,012 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-03-03 15:49:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:14,025 INFO L225 Difference]: With dead ends: 3924 [2025-03-03 15:49:14,026 INFO L226 Difference]: Without dead ends: 3247 [2025-03-03 15:49:14,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:14,030 INFO L435 NwaCegarLoop]: 4666 mSDtfsCounter, 4959 mSDsluCounter, 14059 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:14,031 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.8s Time] [2025-03-03 15:49:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2025-03-03 15:49:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 3138. [2025-03-03 15:49:14,118 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-03-03 15:49:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 5514 transitions. [2025-03-03 15:49:14,134 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 5514 transitions. Word has length 156 [2025-03-03 15:49:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:14,135 INFO L471 AbstractCegarLoop]: Abstraction has 3138 states and 5514 transitions. [2025-03-03 15:49:14,136 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-03-03 15:49:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 5514 transitions. [2025-03-03 15:49:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:14,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:14,139 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-03-03 15:49:14,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:49:14,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:14,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:14,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1372175018, now seen corresponding path program 1 times [2025-03-03 15:49:14,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:14,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854463281] [2025-03-03 15:49:14,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:14,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:14,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:14,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:14,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:14,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854463281] [2025-03-03 15:49:14,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854463281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:14,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105946946] [2025-03-03 15:49:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:14,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:14,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:14,308 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-03-03 15:49:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:14,861 INFO L93 Difference]: Finished difference Result 4945 states and 8331 transitions. [2025-03-03 15:49:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:14,862 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-03-03 15:49:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:14,876 INFO L225 Difference]: With dead ends: 4945 [2025-03-03 15:49:14,876 INFO L226 Difference]: Without dead ends: 3946 [2025-03-03 15:49:14,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:14,880 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.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:14,881 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.4s Time] [2025-03-03 15:49:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2025-03-03 15:49:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3821. [2025-03-03 15:49:15,030 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-03-03 15:49:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 6567 transitions. [2025-03-03 15:49:15,044 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 6567 transitions. Word has length 156 [2025-03-03 15:49:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:15,044 INFO L471 AbstractCegarLoop]: Abstraction has 3821 states and 6567 transitions. [2025-03-03 15:49:15,044 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-03-03 15:49:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 6567 transitions. [2025-03-03 15:49:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:15,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:15,046 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-03-03 15:49:15,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:49:15,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:15,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1227765323, now seen corresponding path program 1 times [2025-03-03 15:49:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:15,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307205163] [2025-03-03 15:49:15,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:15,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:15,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:15,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307205163] [2025-03-03 15:49:15,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307205163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915000000] [2025-03-03 15:49:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:15,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:15,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:15,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:15,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:15,183 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-03-03 15:49:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:15,826 INFO L93 Difference]: Finished difference Result 7138 states and 11782 transitions. [2025-03-03 15:49:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:15,826 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-03-03 15:49:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:15,845 INFO L225 Difference]: With dead ends: 7138 [2025-03-03 15:49:15,845 INFO L226 Difference]: Without dead ends: 5456 [2025-03-03 15:49:15,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:15,852 INFO L435 NwaCegarLoop]: 4659 mSDtfsCounter, 4949 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:15,853 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.5s Time] [2025-03-03 15:49:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2025-03-03 15:49:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5298. [2025-03-03 15:49:15,978 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-03-03 15:49:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 8899 transitions. [2025-03-03 15:49:15,990 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 8899 transitions. Word has length 156 [2025-03-03 15:49:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:15,990 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 8899 transitions. [2025-03-03 15:49:15,990 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-03-03 15:49:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 8899 transitions. [2025-03-03 15:49:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:15,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:15,994 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-03-03 15:49:15,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:49:15,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:15,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1500201610, now seen corresponding path program 1 times [2025-03-03 15:49:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523106863] [2025-03-03 15:49:15,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:16,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:16,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:16,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:16,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:16,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:16,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523106863] [2025-03-03 15:49:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523106863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:16,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654805690] [2025-03-03 15:49:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:16,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:16,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:16,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:16,202 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-03-03 15:49:16,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:16,860 INFO L93 Difference]: Finished difference Result 11949 states and 19576 transitions. [2025-03-03 15:49:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:16,861 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-03-03 15:49:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:16,897 INFO L225 Difference]: With dead ends: 11949 [2025-03-03 15:49:16,897 INFO L226 Difference]: Without dead ends: 8790 [2025-03-03 15:49:16,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:16,910 INFO L435 NwaCegarLoop]: 4656 mSDtfsCounter, 4944 mSDsluCounter, 14029 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:16,911 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.5s Time] [2025-03-03 15:49:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2025-03-03 15:49:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8567. [2025-03-03 15:49:17,196 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-03-03 15:49:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 14231 transitions. [2025-03-03 15:49:17,221 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 14231 transitions. Word has length 156 [2025-03-03 15:49:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:17,221 INFO L471 AbstractCegarLoop]: Abstraction has 8567 states and 14231 transitions. [2025-03-03 15:49:17,222 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-03-03 15:49:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 14231 transitions. [2025-03-03 15:49:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:17,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:17,227 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-03-03 15:49:17,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:49:17,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash 984862101, now seen corresponding path program 1 times [2025-03-03 15:49:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:17,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471870221] [2025-03-03 15:49:17,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:17,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:17,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:17,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:17,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:17,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471870221] [2025-03-03 15:49:17,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471870221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:17,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:17,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935674458] [2025-03-03 15:49:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:17,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:17,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:17,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:17,380 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-03-03 15:49:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:18,263 INFO L93 Difference]: Finished difference Result 22772 states and 37818 transitions. [2025-03-03 15:49:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:18,263 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-03-03 15:49:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:18,315 INFO L225 Difference]: With dead ends: 22772 [2025-03-03 15:49:18,315 INFO L226 Difference]: Without dead ends: 16344 [2025-03-03 15:49:18,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:18,333 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-03-03 15:49:18,333 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-03-03 15:49:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2025-03-03 15:49:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 15996. [2025-03-03 15:49:18,718 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-03-03 15:49:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26891 transitions. [2025-03-03 15:49:18,755 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26891 transitions. Word has length 156 [2025-03-03 15:49:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:18,755 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26891 transitions. [2025-03-03 15:49:18,756 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-03-03 15:49:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26891 transitions. [2025-03-03 15:49:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:18,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:18,762 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-03-03 15:49:18,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:49:18,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:18,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash 510836118, now seen corresponding path program 1 times [2025-03-03 15:49:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:18,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996796795] [2025-03-03 15:49:18,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:18,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:18,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:18,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:18,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:18,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:18,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:18,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996796795] [2025-03-03 15:49:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996796795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:18,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:18,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013568722] [2025-03-03 15:49:18,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:18,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:18,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:18,853 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-03-03 15:49:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:19,705 INFO L93 Difference]: Finished difference Result 33773 states and 57990 transitions. [2025-03-03 15:49:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:19,705 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-03-03 15:49:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:19,768 INFO L225 Difference]: With dead ends: 33773 [2025-03-03 15:49:19,769 INFO L226 Difference]: Without dead ends: 19916 [2025-03-03 15:49:19,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:19,805 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:19,805 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.3s Time] [2025-03-03 15:49:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19916 states. [2025-03-03 15:49:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19916 to 15996. [2025-03-03 15:49:20,233 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-03-03 15:49:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26858 transitions. [2025-03-03 15:49:20,276 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26858 transitions. Word has length 156 [2025-03-03 15:49:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:20,278 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26858 transitions. [2025-03-03 15:49:20,278 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-03-03 15:49:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26858 transitions. [2025-03-03 15:49:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:20,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:20,286 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-03-03 15:49:20,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:49:20,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:20,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash 218450293, now seen corresponding path program 1 times [2025-03-03 15:49:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:20,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963866602] [2025-03-03 15:49:20,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:20,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:20,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:20,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:20,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:20,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:20,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963866602] [2025-03-03 15:49:20,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963866602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:20,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:20,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:20,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715769734] [2025-03-03 15:49:20,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:20,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:20,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:20,376 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-03-03 15:49:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:20,998 INFO L93 Difference]: Finished difference Result 33528 states and 57434 transitions. [2025-03-03 15:49:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:21,002 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-03-03 15:49:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:21,160 INFO L225 Difference]: With dead ends: 33528 [2025-03-03 15:49:21,160 INFO L226 Difference]: Without dead ends: 19671 [2025-03-03 15:49:21,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:21,189 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-03-03 15:49:21,189 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-03-03 15:49:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2025-03-03 15:49:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 15996. [2025-03-03 15:49:21,754 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-03-03 15:49:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26825 transitions. [2025-03-03 15:49:21,796 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26825 transitions. Word has length 156 [2025-03-03 15:49:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:21,797 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26825 transitions. [2025-03-03 15:49:21,798 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-03-03 15:49:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26825 transitions. [2025-03-03 15:49:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:21,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:21,805 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-03-03 15:49:21,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:49:21,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2146286154, now seen corresponding path program 1 times [2025-03-03 15:49:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418841428] [2025-03-03 15:49:21,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:21,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:21,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:21,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:21,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:21,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:21,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418841428] [2025-03-03 15:49:21,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418841428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:21,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:21,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083133744] [2025-03-03 15:49:21,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:21,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:21,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:21,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:21,931 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-03-03 15:49:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:23,287 INFO L93 Difference]: Finished difference Result 47251 states and 81018 transitions. [2025-03-03 15:49:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:23,288 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-03-03 15:49:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:23,474 INFO L225 Difference]: With dead ends: 47251 [2025-03-03 15:49:23,474 INFO L226 Difference]: Without dead ends: 33394 [2025-03-03 15:49:23,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:23,513 INFO L435 NwaCegarLoop]: 4640 mSDtfsCounter, 4918 mSDsluCounter, 13983 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:23,513 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.5s Time] [2025-03-03 15:49:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33394 states. [2025-03-03 15:49:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33394 to 32879. [2025-03-03 15:49:24,389 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-03-03 15:49:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57165 transitions. [2025-03-03 15:49:24,617 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57165 transitions. Word has length 156 [2025-03-03 15:49:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:24,618 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57165 transitions. [2025-03-03 15:49:24,618 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-03-03 15:49:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57165 transitions. [2025-03-03 15:49:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:24,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:24,628 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-03-03 15:49:24,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:49:24,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:24,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1933851989, now seen corresponding path program 1 times [2025-03-03 15:49:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849887941] [2025-03-03 15:49:24,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:24,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:24,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:24,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:24,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849887941] [2025-03-03 15:49:24,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849887941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:24,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803761392] [2025-03-03 15:49:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:24,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:24,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:24,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:24,719 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-03-03 15:49:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:25,968 INFO L93 Difference]: Finished difference Result 73122 states and 131382 transitions. [2025-03-03 15:49:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:25,969 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-03-03 15:49:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:26,099 INFO L225 Difference]: With dead ends: 73122 [2025-03-03 15:49:26,099 INFO L226 Difference]: Without dead ends: 42382 [2025-03-03 15:49:26,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:26,166 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-03-03 15:49:26,166 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-03-03 15:49:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42382 states. [2025-03-03 15:49:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42382 to 32879. [2025-03-03 15:49:27,460 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-03-03 15:49:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57100 transitions. [2025-03-03 15:49:27,552 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57100 transitions. Word has length 156 [2025-03-03 15:49:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:27,554 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57100 transitions. [2025-03-03 15:49:27,554 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-03-03 15:49:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57100 transitions. [2025-03-03 15:49:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:27,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:27,564 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-03-03 15:49:27,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:49:27,564 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:27,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -566929962, now seen corresponding path program 1 times [2025-03-03 15:49:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:27,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635516178] [2025-03-03 15:49:27,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:27,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:27,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:27,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:27,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635516178] [2025-03-03 15:49:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635516178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128115387] [2025-03-03 15:49:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:27,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:27,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:27,659 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-03-03 15:49:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:29,971 INFO L93 Difference]: Finished difference Result 108360 states and 195178 transitions. [2025-03-03 15:49:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:29,972 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-03-03 15:49:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:30,264 INFO L225 Difference]: With dead ends: 108360 [2025-03-03 15:49:30,265 INFO L226 Difference]: Without dead ends: 77620 [2025-03-03 15:49:30,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:30,354 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 5258 mSDsluCounter, 13365 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:30,354 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.6s Time] [2025-03-03 15:49:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77620 states. [2025-03-03 15:49:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77620 to 71799. [2025-03-03 15:49:33,309 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-03-03 15:49:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132806 transitions. [2025-03-03 15:49:33,585 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132806 transitions. Word has length 156 [2025-03-03 15:49:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:33,585 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132806 transitions. [2025-03-03 15:49:33,585 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-03-03 15:49:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132806 transitions. [2025-03-03 15:49:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:33,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:33,601 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-03-03 15:49:33,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:49:33,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:33,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash -93411019, now seen corresponding path program 1 times [2025-03-03 15:49:33,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:33,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277830643] [2025-03-03 15:49:33,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:33,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:33,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:33,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:33,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277830643] [2025-03-03 15:49:33,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277830643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:33,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429259382] [2025-03-03 15:49:33,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:33,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:33,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:33,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:33,673 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-03-03 15:49:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:36,904 INFO L93 Difference]: Finished difference Result 165538 states and 319858 transitions. [2025-03-03 15:49:36,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:36,905 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-03-03 15:49:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:37,417 INFO L225 Difference]: With dead ends: 165538 [2025-03-03 15:49:37,418 INFO L226 Difference]: Without dead ends: 95878 [2025-03-03 15:49:37,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:37,700 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4654 mSDsluCounter, 8549 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:37,701 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.2s Time] [2025-03-03 15:49:37,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95878 states. [2025-03-03 15:49:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95878 to 71799. [2025-03-03 15:49:43,044 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-03-03 15:49:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132677 transitions. [2025-03-03 15:49:43,303 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132677 transitions. Word has length 156 [2025-03-03 15:49:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:43,303 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132677 transitions. [2025-03-03 15:49:43,303 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-03-03 15:49:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132677 transitions. [2025-03-03 15:49:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:49:43,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:43,318 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-03-03 15:49:43,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:49:43,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:43,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 337505782, now seen corresponding path program 1 times [2025-03-03 15:49:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587258821] [2025-03-03 15:49:43,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:43,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:43,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:49:43,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:49:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587258821] [2025-03-03 15:49:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587258821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:43,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:43,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479767978] [2025-03-03 15:49:43,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:43,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:43,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:43,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:43,416 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-03-03 15:49:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:47,830 INFO L93 Difference]: Finished difference Result 241756 states and 474039 transitions. [2025-03-03 15:49:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:47,830 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-03-03 15:49:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:48,776 INFO L225 Difference]: With dead ends: 241756 [2025-03-03 15:49:48,777 INFO L226 Difference]: Without dead ends: 172096 [2025-03-03 15:49:49,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:49,126 INFO L435 NwaCegarLoop]: 4622 mSDtfsCounter, 5146 mSDsluCounter, 13926 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:49,126 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.4s Time] [2025-03-03 15:49:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172096 states.