./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_label44+token_ring.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eebca77f45674e9c747126627d8fffbab7911c70d4e1d781272ecaec26772b5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:53:04,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:53:04,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:53:04,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:53:04,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:53:04,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:53:04,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:53:04,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:53:04,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:53:04,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:53:04,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:53:04,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:53:04,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:53:04,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:53:04,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:53:04,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:53:04,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:53:04,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:53:04,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:53:04,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:53:04,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:53:04,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:53:04,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:53:04,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:53:04,945 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 -> eebca77f45674e9c747126627d8fffbab7911c70d4e1d781272ecaec26772b5e [2025-03-08 06:53:05,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:53:05,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:53:05,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:53:05,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:53:05,200 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:53:05,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c [2025-03-08 06:53:06,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75a344d0/fc42129affef4688b85809d13e54268d/FLAG11dc63f88 [2025-03-08 06:53:06,994 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:53:06,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c [2025-03-08 06:53:07,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75a344d0/fc42129affef4688b85809d13e54268d/FLAG11dc63f88 [2025-03-08 06:53:07,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75a344d0/fc42129affef4688b85809d13e54268d [2025-03-08 06:53:07,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:53:07,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:53:07,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:53:07,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:53:07,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:53:07,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:53:07" (1/1) ... [2025-03-08 06:53:07,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44818225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:07, skipping insertion in model container [2025-03-08 06:53:07,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:53:07" (1/1) ... [2025-03-08 06:53:07,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:53:08,248 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_label44+token_ring.09.cil-1.c[377340,377353] [2025-03-08 06:53:08,277 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_label44+token_ring.09.cil-1.c[383339,383352] [2025-03-08 06:53:08,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:53:08,518 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:53:09,028 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_label44+token_ring.09.cil-1.c[377340,377353] [2025-03-08 06:53:09,033 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_label44+token_ring.09.cil-1.c[383339,383352] [2025-03-08 06:53:09,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:53:09,098 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:53:09,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09 WrapperNode [2025-03-08 06:53:09,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:53:09,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:53:09,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:53:09,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:53:09,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,461 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13014 [2025-03-08 06:53:09,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:53:09,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:53:09,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:53:09,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:53:09,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,709 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-08 06:53:09,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:53:09,968 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:53:09,968 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:53:09,968 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:53:09,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (1/1) ... [2025-03-08 06:53:09,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:53:09,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:53:09,996 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-08 06:53:09,998 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-08 06:53:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:53:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:53:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:53:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:53:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:53:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:53:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:53:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:53:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:53:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:53:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:53:10,019 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:53:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:53:10,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:53:10,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:53:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:53:10,130 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:53:10,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:53:15,972 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:53:15,973 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:53:15,973 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:53:15,973 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:53:15,973 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:53:15,974 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:53:15,974 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:53:16,200 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2025-03-08 06:53:16,200 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:53:16,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:53:16,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:53:16,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:53:16 BoogieIcfgContainer [2025-03-08 06:53:16,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:53:16,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:53:16,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:53:16,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:53:16,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:53:07" (1/3) ... [2025-03-08 06:53:16,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4121bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:53:16, skipping insertion in model container [2025-03-08 06:53:16,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:09" (2/3) ... [2025-03-08 06:53:16,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4121bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:53:16, skipping insertion in model container [2025-03-08 06:53:16,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:53:16" (3/3) ... [2025-03-08 06:53:16,264 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.09.cil-1.c [2025-03-08 06:53:16,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:53:16,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+token_ring.09.cil-1.c that has 7 procedures, 2488 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-08 06:53:16,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:53:16,394 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;@46c9c32f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:53:16,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:53:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 06:53:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:16,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:16,414 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] [2025-03-08 06:53:16,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:16,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -581836028, now seen corresponding path program 1 times [2025-03-08 06:53:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:16,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656848665] [2025-03-08 06:53:16,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:16,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:16,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:16,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:16,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:16,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:16,951 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-08 06:53:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656848665] [2025-03-08 06:53:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656848665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:16,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313705988] [2025-03-08 06:53:16,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:16,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:16,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:16,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:16,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:16,981 INFO L87 Difference]: Start difference. First operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-08 06:53:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:17,588 INFO L93 Difference]: Finished difference Result 5281 states and 9643 transitions. [2025-03-08 06:53:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:53:17,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:17,617 INFO L225 Difference]: With dead ends: 5281 [2025-03-08 06:53:17,618 INFO L226 Difference]: Without dead ends: 2740 [2025-03-08 06:53:17,630 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-08 06:53:17,632 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 4919 mSDsluCounter, 8983 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 13375 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:17,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 13375 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:17,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2025-03-08 06:53:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2717. [2025-03-08 06:53:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2661 states have (on average 1.808718526869598) internal successors, (4813), 2664 states have internal predecessors, (4813), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-08 06:53:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4896 transitions. [2025-03-08 06:53:17,796 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4896 transitions. Word has length 143 [2025-03-08 06:53:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:17,796 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4896 transitions. [2025-03-08 06:53:17,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-08 06:53:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4896 transitions. [2025-03-08 06:53:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:17,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:17,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] [2025-03-08 06:53:17,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:53:17,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:17,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash 178846534, now seen corresponding path program 1 times [2025-03-08 06:53:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:17,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134089827] [2025-03-08 06:53:17,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:17,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:17,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:17,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:17,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:18,118 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-08 06:53:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134089827] [2025-03-08 06:53:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134089827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104483414] [2025-03-08 06:53:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:18,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:18,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:18,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:18,120 INFO L87 Difference]: Start difference. First operand 2717 states and 4896 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:18,437 INFO L93 Difference]: Finished difference Result 3356 states and 5923 transitions. [2025-03-08 06:53:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:18,450 INFO L225 Difference]: With dead ends: 3356 [2025-03-08 06:53:18,451 INFO L226 Difference]: Without dead ends: 2777 [2025-03-08 06:53:18,454 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-08 06:53:18,456 INFO L435 NwaCegarLoop]: 4311 mSDtfsCounter, 4592 mSDsluCounter, 8497 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4609 SdHoareTripleChecker+Valid, 12808 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:18,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4609 Valid, 12808 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2025-03-08 06:53:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2717. [2025-03-08 06:53:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2661 states have (on average 1.807966929725667) internal successors, (4811), 2664 states have internal predecessors, (4811), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-08 06:53:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4894 transitions. [2025-03-08 06:53:18,529 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4894 transitions. Word has length 143 [2025-03-08 06:53:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:18,529 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4894 transitions. [2025-03-08 06:53:18,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4894 transitions. [2025-03-08 06:53:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:18,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:18,532 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] [2025-03-08 06:53:18,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:53:18,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:18,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:18,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1301125733, now seen corresponding path program 1 times [2025-03-08 06:53:18,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:18,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493675481] [2025-03-08 06:53:18,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:18,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:18,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:18,723 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-08 06:53:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:18,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493675481] [2025-03-08 06:53:18,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493675481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:18,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:18,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917680948] [2025-03-08 06:53:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:18,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:18,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:18,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:18,725 INFO L87 Difference]: Start difference. First operand 2717 states and 4894 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:19,328 INFO L93 Difference]: Finished difference Result 3669 states and 6413 transitions. [2025-03-08 06:53:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:19,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:19,341 INFO L225 Difference]: With dead ends: 3669 [2025-03-08 06:53:19,341 INFO L226 Difference]: Without dead ends: 3090 [2025-03-08 06:53:19,344 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-08 06:53:19,345 INFO L435 NwaCegarLoop]: 4563 mSDtfsCounter, 4848 mSDsluCounter, 13717 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4865 SdHoareTripleChecker+Valid, 18280 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:19,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4865 Valid, 18280 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2025-03-08 06:53:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2991. [2025-03-08 06:53:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2910 states have (on average 1.7859106529209623) internal successors, (5197), 2914 states have internal predecessors, (5197), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-03-08 06:53:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 5319 transitions. [2025-03-08 06:53:19,416 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 5319 transitions. Word has length 143 [2025-03-08 06:53:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:19,416 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 5319 transitions. [2025-03-08 06:53:19,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 5319 transitions. [2025-03-08 06:53:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:19,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:19,418 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] [2025-03-08 06:53:19,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:53:19,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:19,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash -602334362, now seen corresponding path program 1 times [2025-03-08 06:53:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057984095] [2025-03-08 06:53:19,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:19,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:19,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:19,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:19,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:19,565 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-08 06:53:19,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:19,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057984095] [2025-03-08 06:53:19,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057984095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:19,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:19,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:19,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866428193] [2025-03-08 06:53:19,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:19,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:19,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:19,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:19,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:19,568 INFO L87 Difference]: Start difference. First operand 2991 states and 5319 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:20,162 INFO L93 Difference]: Finished difference Result 4532 states and 7769 transitions. [2025-03-08 06:53:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:20,176 INFO L225 Difference]: With dead ends: 4532 [2025-03-08 06:53:20,176 INFO L226 Difference]: Without dead ends: 3679 [2025-03-08 06:53:20,180 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-08 06:53:20,181 INFO L435 NwaCegarLoop]: 4555 mSDtfsCounter, 4840 mSDsluCounter, 13695 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4857 SdHoareTripleChecker+Valid, 18250 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:20,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4857 Valid, 18250 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2025-03-08 06:53:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3571. [2025-03-08 06:53:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3438 states have (on average 1.752763234438627) internal successors, (6026), 3446 states have internal predecessors, (6026), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-03-08 06:53:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 6232 transitions. [2025-03-08 06:53:20,382 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 6232 transitions. Word has length 143 [2025-03-08 06:53:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:20,383 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 6232 transitions. [2025-03-08 06:53:20,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 6232 transitions. [2025-03-08 06:53:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:20,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:20,386 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] [2025-03-08 06:53:20,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:53:20,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:20,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:20,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1243420505, now seen corresponding path program 1 times [2025-03-08 06:53:20,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:20,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227625120] [2025-03-08 06:53:20,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:20,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:20,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:20,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:20,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:20,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:20,559 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-08 06:53:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:20,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227625120] [2025-03-08 06:53:20,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227625120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:20,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:20,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:20,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825253622] [2025-03-08 06:53:20,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:20,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:20,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:20,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:20,561 INFO L87 Difference]: Start difference. First operand 3571 states and 6232 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:21,262 INFO L93 Difference]: Finished difference Result 6392 states and 10752 transitions. [2025-03-08 06:53:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:21,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:21,284 INFO L225 Difference]: With dead ends: 6392 [2025-03-08 06:53:21,284 INFO L226 Difference]: Without dead ends: 4959 [2025-03-08 06:53:21,290 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-08 06:53:21,291 INFO L435 NwaCegarLoop]: 4552 mSDtfsCounter, 4835 mSDsluCounter, 13686 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4852 SdHoareTripleChecker+Valid, 18238 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:21,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4852 Valid, 18238 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2025-03-08 06:53:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4824. [2025-03-08 06:53:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4824 states, 4581 states have (on average 1.7135996507312814) internal successors, (7850), 4603 states have internal predecessors, (7850), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-08 06:53:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 8248 transitions. [2025-03-08 06:53:21,461 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 8248 transitions. Word has length 143 [2025-03-08 06:53:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:21,462 INFO L471 AbstractCegarLoop]: Abstraction has 4824 states and 8248 transitions. [2025-03-08 06:53:21,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 8248 transitions. [2025-03-08 06:53:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:21,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:21,464 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] [2025-03-08 06:53:21,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:53:21,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash -17174714, now seen corresponding path program 1 times [2025-03-08 06:53:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:21,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537439338] [2025-03-08 06:53:21,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:21,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:21,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:21,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:21,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:21,577 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-08 06:53:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537439338] [2025-03-08 06:53:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537439338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:21,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:21,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342999719] [2025-03-08 06:53:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:21,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:21,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:21,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:21,579 INFO L87 Difference]: Start difference. First operand 4824 states and 8248 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:22,197 INFO L93 Difference]: Finished difference Result 10465 states and 17466 transitions. [2025-03-08 06:53:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:22,225 INFO L225 Difference]: With dead ends: 10465 [2025-03-08 06:53:22,225 INFO L226 Difference]: Without dead ends: 7779 [2025-03-08 06:53:22,234 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-08 06:53:22,235 INFO L435 NwaCegarLoop]: 4549 mSDtfsCounter, 4830 mSDsluCounter, 13677 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4847 SdHoareTripleChecker+Valid, 18226 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:22,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4847 Valid, 18226 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7779 states. [2025-03-08 06:53:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7779 to 7591. [2025-03-08 06:53:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7591 states, 7110 states have (on average 1.6824191279887482) internal successors, (11962), 7178 states have internal predecessors, (11962), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:53:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7591 states to 7591 states and 12840 transitions. [2025-03-08 06:53:22,497 INFO L78 Accepts]: Start accepts. Automaton has 7591 states and 12840 transitions. Word has length 143 [2025-03-08 06:53:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:22,497 INFO L471 AbstractCegarLoop]: Abstraction has 7591 states and 12840 transitions. [2025-03-08 06:53:22,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7591 states and 12840 transitions. [2025-03-08 06:53:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:22,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:22,502 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] [2025-03-08 06:53:22,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:53:22,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:22,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:22,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1269307591, now seen corresponding path program 1 times [2025-03-08 06:53:22,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:22,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885470592] [2025-03-08 06:53:22,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:22,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:22,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:22,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:22,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:22,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:22,606 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-08 06:53:22,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:22,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885470592] [2025-03-08 06:53:22,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885470592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:22,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:22,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648957967] [2025-03-08 06:53:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:22,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:22,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:22,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:22,609 INFO L87 Difference]: Start difference. First operand 7591 states and 12840 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:22,963 INFO L93 Difference]: Finished difference Result 14206 states and 24060 transitions. [2025-03-08 06:53:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:22,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:22,993 INFO L225 Difference]: With dead ends: 14206 [2025-03-08 06:53:22,993 INFO L226 Difference]: Without dead ends: 8753 [2025-03-08 06:53:23,009 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-08 06:53:23,009 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4584 mSDsluCounter, 8472 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4601 SdHoareTripleChecker+Valid, 12770 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:23,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4601 Valid, 12770 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2025-03-08 06:53:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 7591. [2025-03-08 06:53:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7591 states, 7110 states have (on average 1.680028129395218) internal successors, (11945), 7178 states have internal predecessors, (11945), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:53:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7591 states to 7591 states and 12823 transitions. [2025-03-08 06:53:23,228 INFO L78 Accepts]: Start accepts. Automaton has 7591 states and 12823 transitions. Word has length 143 [2025-03-08 06:53:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:23,228 INFO L471 AbstractCegarLoop]: Abstraction has 7591 states and 12823 transitions. [2025-03-08 06:53:23,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7591 states and 12823 transitions. [2025-03-08 06:53:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:23,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:23,233 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] [2025-03-08 06:53:23,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:53:23,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:23,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:23,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1044497626, now seen corresponding path program 1 times [2025-03-08 06:53:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:23,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753496326] [2025-03-08 06:53:23,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:23,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:23,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:23,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:23,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:23,325 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-08 06:53:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753496326] [2025-03-08 06:53:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753496326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72841310] [2025-03-08 06:53:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:23,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:23,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:23,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:23,327 INFO L87 Difference]: Start difference. First operand 7591 states and 12823 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:23,744 INFO L93 Difference]: Finished difference Result 14123 states and 23860 transitions. [2025-03-08 06:53:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:23,768 INFO L225 Difference]: With dead ends: 14123 [2025-03-08 06:53:23,768 INFO L226 Difference]: Without dead ends: 8670 [2025-03-08 06:53:23,780 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-08 06:53:23,783 INFO L435 NwaCegarLoop]: 4295 mSDtfsCounter, 4581 mSDsluCounter, 8467 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4598 SdHoareTripleChecker+Valid, 12762 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:23,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4598 Valid, 12762 Invalid, 390 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states. [2025-03-08 06:53:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 7591. [2025-03-08 06:53:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7591 states, 7110 states have (on average 1.6776371308016877) internal successors, (11928), 7178 states have internal predecessors, (11928), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:53:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7591 states to 7591 states and 12806 transitions. [2025-03-08 06:53:23,979 INFO L78 Accepts]: Start accepts. Automaton has 7591 states and 12806 transitions. Word has length 143 [2025-03-08 06:53:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 7591 states and 12806 transitions. [2025-03-08 06:53:23,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 7591 states and 12806 transitions. [2025-03-08 06:53:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:23,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:23,985 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] [2025-03-08 06:53:23,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:53:23,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2067452135, now seen corresponding path program 1 times [2025-03-08 06:53:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749373740] [2025-03-08 06:53:23,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:23,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:23,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:23,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:24,097 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-08 06:53:24,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749373740] [2025-03-08 06:53:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749373740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302672590] [2025-03-08 06:53:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:24,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:24,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:24,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:24,099 INFO L87 Difference]: Start difference. First operand 7591 states and 12806 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:24,879 INFO L93 Difference]: Finished difference Result 19396 states and 32614 transitions. [2025-03-08 06:53:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:24,917 INFO L225 Difference]: With dead ends: 19396 [2025-03-08 06:53:24,917 INFO L226 Difference]: Without dead ends: 13943 [2025-03-08 06:53:24,929 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-08 06:53:24,929 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 4809 mSDsluCounter, 13640 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4826 SdHoareTripleChecker+Valid, 18176 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:24,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4826 Valid, 18176 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13943 states. [2025-03-08 06:53:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13943 to 13692. [2025-03-08 06:53:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13692 states, 12681 states have (on average 1.662644901821623) internal successors, (21084), 12895 states have internal predecessors, (21084), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-03-08 06:53:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13692 states to 13692 states and 23306 transitions. [2025-03-08 06:53:25,276 INFO L78 Accepts]: Start accepts. Automaton has 13692 states and 23306 transitions. Word has length 143 [2025-03-08 06:53:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:25,277 INFO L471 AbstractCegarLoop]: Abstraction has 13692 states and 23306 transitions. [2025-03-08 06:53:25,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 13692 states and 23306 transitions. [2025-03-08 06:53:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:25,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:25,284 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] [2025-03-08 06:53:25,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:53:25,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:25,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:25,284 INFO L85 PathProgramCache]: Analyzing trace with hash 920911622, now seen corresponding path program 1 times [2025-03-08 06:53:25,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:25,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985480551] [2025-03-08 06:53:25,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:25,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:25,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:25,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:25,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:25,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:25,393 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-08 06:53:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:25,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985480551] [2025-03-08 06:53:25,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985480551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:25,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:25,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164091232] [2025-03-08 06:53:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:25,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:25,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:25,395 INFO L87 Difference]: Start difference. First operand 13692 states and 23306 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:26,746 INFO L93 Difference]: Finished difference Result 41733 states and 72193 transitions. [2025-03-08 06:53:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:26,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:26,857 INFO L225 Difference]: With dead ends: 41733 [2025-03-08 06:53:26,857 INFO L226 Difference]: Without dead ends: 30179 [2025-03-08 06:53:26,899 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-08 06:53:26,900 INFO L435 NwaCegarLoop]: 4531 mSDtfsCounter, 5088 mSDsluCounter, 13620 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 18151 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:26,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 18151 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30179 states. [2025-03-08 06:53:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30179 to 27499. [2025-03-08 06:53:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27499 states, 25298 states have (on average 1.6693809787334968) internal successors, (42232), 25966 states have internal predecessors, (42232), 1143 states have call successors, (1143), 390 states have call predecessors, (1143), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-03-08 06:53:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27499 states to 27499 states and 48614 transitions. [2025-03-08 06:53:27,766 INFO L78 Accepts]: Start accepts. Automaton has 27499 states and 48614 transitions. Word has length 143 [2025-03-08 06:53:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:27,767 INFO L471 AbstractCegarLoop]: Abstraction has 27499 states and 48614 transitions. [2025-03-08 06:53:27,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27499 states and 48614 transitions. [2025-03-08 06:53:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:27,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:27,777 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] [2025-03-08 06:53:27,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:53:27,777 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:27,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash -362999545, now seen corresponding path program 1 times [2025-03-08 06:53:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:27,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034034482] [2025-03-08 06:53:27,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:27,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:27,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:27,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:27,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:27,881 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-08 06:53:27,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:27,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034034482] [2025-03-08 06:53:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034034482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:27,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332877094] [2025-03-08 06:53:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:27,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:27,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:27,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:27,884 INFO L87 Difference]: Start difference. First operand 27499 states and 48614 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:29,673 INFO L93 Difference]: Finished difference Result 88540 states and 162999 transitions. [2025-03-08 06:53:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:29,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:30,109 INFO L225 Difference]: With dead ends: 88540 [2025-03-08 06:53:30,109 INFO L226 Difference]: Without dead ends: 63179 [2025-03-08 06:53:30,178 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-08 06:53:30,179 INFO L435 NwaCegarLoop]: 4524 mSDtfsCounter, 5020 mSDsluCounter, 13601 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5047 SdHoareTripleChecker+Valid, 18125 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:30,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5047 Valid, 18125 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:53:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63179 states. [2025-03-08 06:53:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63179 to 58905. [2025-03-08 06:53:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58905 states, 53870 states have (on average 1.6846111007982179) internal successors, (90750), 55932 states have internal predecessors, (90750), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:53:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58905 states to 58905 states and 111532 transitions. [2025-03-08 06:53:32,807 INFO L78 Accepts]: Start accepts. Automaton has 58905 states and 111532 transitions. Word has length 143 [2025-03-08 06:53:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:32,807 INFO L471 AbstractCegarLoop]: Abstraction has 58905 states and 111532 transitions. [2025-03-08 06:53:32,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 58905 states and 111532 transitions. [2025-03-08 06:53:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:32,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:32,825 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] [2025-03-08 06:53:32,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:53:32,825 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:32,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1186681016, now seen corresponding path program 1 times [2025-03-08 06:53:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:32,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507201630] [2025-03-08 06:53:32,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:32,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:32,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:32,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:32,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:32,911 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-08 06:53:32,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:32,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507201630] [2025-03-08 06:53:32,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507201630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:32,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:32,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:32,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307324135] [2025-03-08 06:53:32,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:32,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:32,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:32,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:32,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:32,914 INFO L87 Difference]: Start difference. First operand 58905 states and 111532 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:36,363 INFO L93 Difference]: Finished difference Result 133184 states and 264178 transitions. [2025-03-08 06:53:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:36,920 INFO L225 Difference]: With dead ends: 133184 [2025-03-08 06:53:36,921 INFO L226 Difference]: Without dead ends: 76417 [2025-03-08 06:53:37,032 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-08 06:53:37,033 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 4572 mSDsluCounter, 8444 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 12728 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:37,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 12728 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76417 states. [2025-03-08 06:53:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76417 to 58905. [2025-03-08 06:53:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58905 states, 53870 states have (on average 1.682216447002042) internal successors, (90621), 55932 states have internal predecessors, (90621), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:53:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58905 states to 58905 states and 111403 transitions. [2025-03-08 06:53:40,339 INFO L78 Accepts]: Start accepts. Automaton has 58905 states and 111403 transitions. Word has length 143 [2025-03-08 06:53:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:40,339 INFO L471 AbstractCegarLoop]: Abstraction has 58905 states and 111403 transitions. [2025-03-08 06:53:40,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 58905 states and 111403 transitions. [2025-03-08 06:53:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:40,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:40,355 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] [2025-03-08 06:53:40,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:53:40,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:40,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash -104872729, now seen corresponding path program 1 times [2025-03-08 06:53:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:40,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244831139] [2025-03-08 06:53:40,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:40,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:40,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:40,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:40,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:40,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:40,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244831139] [2025-03-08 06:53:40,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244831139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:40,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:40,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:40,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154518119] [2025-03-08 06:53:40,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:40,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:40,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:40,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:40,429 INFO L87 Difference]: Start difference. First operand 58905 states and 111403 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:44,112 INFO L93 Difference]: Finished difference Result 130995 states and 259542 transitions. [2025-03-08 06:53:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:44,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:44,469 INFO L225 Difference]: With dead ends: 130995 [2025-03-08 06:53:44,469 INFO L226 Difference]: Without dead ends: 74228 [2025-03-08 06:53:44,670 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-08 06:53:44,671 INFO L435 NwaCegarLoop]: 4281 mSDtfsCounter, 4569 mSDsluCounter, 8439 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4586 SdHoareTripleChecker+Valid, 12720 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:44,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4586 Valid, 12720 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74228 states. [2025-03-08 06:53:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74228 to 58905. [2025-03-08 06:53:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58905 states, 53870 states have (on average 1.6798217932058659) internal successors, (90492), 55932 states have internal predecessors, (90492), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:53:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58905 states to 58905 states and 111274 transitions. [2025-03-08 06:53:47,809 INFO L78 Accepts]: Start accepts. Automaton has 58905 states and 111274 transitions. Word has length 143 [2025-03-08 06:53:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:47,810 INFO L471 AbstractCegarLoop]: Abstraction has 58905 states and 111274 transitions. [2025-03-08 06:53:47,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 58905 states and 111274 transitions. [2025-03-08 06:53:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:53:47,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:47,825 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] [2025-03-08 06:53:47,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:53:47,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:47,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash -624165016, now seen corresponding path program 1 times [2025-03-08 06:53:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656594896] [2025-03-08 06:53:47,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:47,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:53:47,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:53:47,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:47,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:47,912 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-08 06:53:47,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:47,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656594896] [2025-03-08 06:53:47,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656594896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:47,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:47,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:47,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062453917] [2025-03-08 06:53:47,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:47,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:47,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:47,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:47,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:47,913 INFO L87 Difference]: Start difference. First operand 58905 states and 111274 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:53:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:53,460 INFO L93 Difference]: Finished difference Result 190270 states and 386045 transitions. [2025-03-08 06:53:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 06:53:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:54,060 INFO L225 Difference]: With dead ends: 190270 [2025-03-08 06:53:54,060 INFO L226 Difference]: Without dead ends: 133503 [2025-03-08 06:53:54,180 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-08 06:53:54,180 INFO L435 NwaCegarLoop]: 4511 mSDtfsCounter, 4909 mSDsluCounter, 13564 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 18075 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:54,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 18075 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:53:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133503 states. [2025-03-08 06:54:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133503 to 128086. [2025-03-08 06:54:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128086 states, 115989 states have (on average 1.6883325142901482) internal successors, (195828), 122297 states have internal predecessors, (195828), 4247 states have call successors, (4247), 1542 states have call predecessors, (4247), 7848 states have return successors, (69783), 4502 states have call predecessors, (69783), 4247 states have call successors, (69783) [2025-03-08 06:54:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128086 states to 128086 states and 269858 transitions. [2025-03-08 06:54:01,101 INFO L78 Accepts]: Start accepts. Automaton has 128086 states and 269858 transitions. Word has length 143 [2025-03-08 06:54:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:01,101 INFO L471 AbstractCegarLoop]: Abstraction has 128086 states and 269858 transitions. [2025-03-08 06:54:01,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 06:54:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 128086 states and 269858 transitions. [2025-03-08 06:54:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:54:01,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:01,140 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] [2025-03-08 06:54:01,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:54:01,140 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:01,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1610747705, now seen corresponding path program 1 times [2025-03-08 06:54:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666691521] [2025-03-08 06:54:01,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:01,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:54:01,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:54:01,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:01,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:01,224 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-08 06:54:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666691521] [2025-03-08 06:54:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666691521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:54:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156007129] [2025-03-08 06:54:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:54:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:01,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:54:01,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:54:01,227 INFO L87 Difference]: Start difference. First operand 128086 states and 269858 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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)