./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.09.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1799d95d0e216b78a87282e1c07d247f4f74dae2fd2ab1bbf062b2cf09b9c7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:17:47,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:17:47,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:17:47,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:17:47,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:17:47,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:17:47,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:17:47,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:17:47,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:17:47,910 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:17:47,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:17:47,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:17:47,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:17:47,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:17:47,912 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:17:47,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:17:47,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:17:47,913 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:17:47,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:17:47,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:17:47,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:17:47,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:17:47,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:17:47,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:17:47,914 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:17:47,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:17:47,914 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:17:47,914 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:17:47,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:17:47,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:17:47,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:17:47,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:17:47,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:17:47,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:17:47,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:17:47,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:17:47,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:17:47,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:17:47,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:17:47,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:17:47,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:17:47,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:17:47,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:17:47,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1799d95d0e216b78a87282e1c07d247f4f74dae2fd2ab1bbf062b2cf09b9c7c [2025-02-05 17:17:48,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:17:48,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:17:48,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:17:48,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:17:48,277 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:17:48,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.09.cil-1.c [2025-02-05 17:17:49,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ca2dea82/13b93cbf789646aa9078f893c8f6be9a/FLAGe7e47f606 [2025-02-05 17:17:50,459 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:17:50,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.09.cil-1.c [2025-02-05 17:17:50,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ca2dea82/13b93cbf789646aa9078f893c8f6be9a/FLAGe7e47f606 [2025-02-05 17:17:50,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ca2dea82/13b93cbf789646aa9078f893c8f6be9a [2025-02-05 17:17:50,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:17:50,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:17:50,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:17:50,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:17:50,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:17:50,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:50,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d463407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:50, skipping insertion in model container [2025-02-05 17:17:50,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:17:50" (1/1) ... [2025-02-05 17:17:50,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:17:52,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.09.cil-1.c[375709,375722] [2025-02-05 17:17:52,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.09.cil-1.c[383339,383352] [2025-02-05 17:17:52,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:17:52,888 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:17:53,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.09.cil-1.c[375709,375722] [2025-02-05 17:17:53,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.09.cil-1.c[383339,383352] [2025-02-05 17:17:53,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:17:53,722 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:17:53,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53 WrapperNode [2025-02-05 17:17:53,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:17:53,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:17:53,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:17:53,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:17:53,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:53,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,242 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13014 [2025-02-05 17:17:54,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:17:54,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:17:54,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:17:54,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:17:54,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:17:54,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:54,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:17:54,996 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:17:54,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:17:54,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:17:54,998 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (1/1) ... [2025-02-05 17:17:55,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:17:55,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:17:55,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:17:55,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:17:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:17:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:17:55,066 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:17:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:17:55,066 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:17:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:17:55,067 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:17:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:17:55,068 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:17:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:17:55,068 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:17:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:17:55,068 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:17:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:17:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:17:55,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:17:55,219 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:17:55,221 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:18:03,623 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:18:03,624 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:18:03,625 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:18:03,625 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:18:03,625 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:18:03,625 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:18:03,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:18:03,888 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2025-02-05 17:18:03,889 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:18:03,967 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:18:03,972 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:18:03,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:18:03 BoogieIcfgContainer [2025-02-05 17:18:03,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:18:03,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:18:03,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:18:03,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:18:03,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:17:50" (1/3) ... [2025-02-05 17:18:03,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b60644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:18:03, skipping insertion in model container [2025-02-05 17:18:03,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:53" (2/3) ... [2025-02-05 17:18:03,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b60644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:18:03, skipping insertion in model container [2025-02-05 17:18:03,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:18:03" (3/3) ... [2025-02-05 17:18:03,984 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.09.cil-1.c [2025-02-05 17:18:04,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:18:04,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label48+token_ring.09.cil-1.c that has 7 procedures, 2510 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-02-05 17:18:04,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:18:04,153 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;@50d26393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:18:04,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:18:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 2510 states, 2478 states have (on average 1.8349475383373688) internal successors, (4547), 2481 states have internal predecessors, (4547), 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-02-05 17:18:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:04,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:04,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:04,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:04,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1505179624, now seen corresponding path program 1 times [2025-02-05 17:18:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:04,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296755290] [2025-02-05 17:18:04,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:04,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:04,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:04,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:04,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:04,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:04,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296755290] [2025-02-05 17:18:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296755290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:04,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:04,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423406688] [2025-02-05 17:18:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:04,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:04,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:04,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:04,985 INFO L87 Difference]: Start difference. First operand has 2510 states, 2478 states have (on average 1.8349475383373688) internal successors, (4547), 2481 states have internal predecessors, (4547), 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 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:05,869 INFO L93 Difference]: Finished difference Result 5347 states and 9709 transitions. [2025-02-05 17:18:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:18:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:05,911 INFO L225 Difference]: With dead ends: 5347 [2025-02-05 17:18:05,912 INFO L226 Difference]: Without dead ends: 2784 [2025-02-05 17:18:05,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:05,931 INFO L435 NwaCegarLoop]: 4414 mSDtfsCounter, 4941 mSDsluCounter, 9049 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4958 SdHoareTripleChecker+Valid, 13463 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:05,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4958 Valid, 13463 Invalid, 559 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:18:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2025-02-05 17:18:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2761. [2025-02-05 17:18:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2705 states have (on average 1.7955637707948244) internal successors, (4857), 2708 states have internal predecessors, (4857), 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-02-05 17:18:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4940 transitions. [2025-02-05 17:18:06,103 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4940 transitions. Word has length 145 [2025-02-05 17:18:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:06,105 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4940 transitions. [2025-02-05 17:18:06,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4940 transitions. [2025-02-05 17:18:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:06,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:06,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:06,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:18:06,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:06,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash -633677862, now seen corresponding path program 1 times [2025-02-05 17:18:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471963283] [2025-02-05 17:18:06,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:06,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:06,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:06,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471963283] [2025-02-05 17:18:06,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471963283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:06,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:06,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864801386] [2025-02-05 17:18:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:06,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:06,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:06,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:06,413 INFO L87 Difference]: Start difference. First operand 2761 states and 4940 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:06,858 INFO L93 Difference]: Finished difference Result 3444 states and 6011 transitions. [2025-02-05 17:18:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:06,875 INFO L225 Difference]: With dead ends: 3444 [2025-02-05 17:18:06,876 INFO L226 Difference]: Without dead ends: 2821 [2025-02-05 17:18:06,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:06,882 INFO L435 NwaCegarLoop]: 4333 mSDtfsCounter, 4614 mSDsluCounter, 8541 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4631 SdHoareTripleChecker+Valid, 12874 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:06,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4631 Valid, 12874 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2025-02-05 17:18:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2761. [2025-02-05 17:18:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2705 states have (on average 1.7948243992606285) internal successors, (4855), 2708 states have internal predecessors, (4855), 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-02-05 17:18:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4938 transitions. [2025-02-05 17:18:06,984 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4938 transitions. Word has length 145 [2025-02-05 17:18:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:06,985 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4938 transitions. [2025-02-05 17:18:06,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4938 transitions. [2025-02-05 17:18:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:06,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:06,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:06,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:18:06,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:06,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash -160158919, now seen corresponding path program 1 times [2025-02-05 17:18:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:06,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412313542] [2025-02-05 17:18:06,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:07,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:07,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:07,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:07,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:07,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:07,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412313542] [2025-02-05 17:18:07,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412313542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:07,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:07,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509198652] [2025-02-05 17:18:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:07,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:07,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:07,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:07,395 INFO L87 Difference]: Start difference. First operand 2761 states and 4938 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:08,465 INFO L93 Difference]: Finished difference Result 3779 states and 6523 transitions. [2025-02-05 17:18:08,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:08,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:08,485 INFO L225 Difference]: With dead ends: 3779 [2025-02-05 17:18:08,486 INFO L226 Difference]: Without dead ends: 3156 [2025-02-05 17:18:08,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:18:08,491 INFO L435 NwaCegarLoop]: 4607 mSDtfsCounter, 4870 mSDsluCounter, 13871 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4887 SdHoareTripleChecker+Valid, 18478 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:08,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4887 Valid, 18478 Invalid, 913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:18:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2025-02-05 17:18:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 3057. [2025-02-05 17:18:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 2976 states have (on average 1.768481182795699) internal successors, (5263), 2980 states have internal predecessors, (5263), 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-02-05 17:18:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 5385 transitions. [2025-02-05 17:18:08,615 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 5385 transitions. Word has length 145 [2025-02-05 17:18:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:08,616 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 5385 transitions. [2025-02-05 17:18:08,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 5385 transitions. [2025-02-05 17:18:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:08,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:08,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:08,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:18:08,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash 270757882, now seen corresponding path program 1 times [2025-02-05 17:18:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933106052] [2025-02-05 17:18:08,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:08,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:08,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:08,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:08,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:08,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:08,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933106052] [2025-02-05 17:18:08,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933106052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:08,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:08,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534572691] [2025-02-05 17:18:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:08,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:08,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:08,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:08,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:08,869 INFO L87 Difference]: Start difference. First operand 3057 states and 5385 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:09,661 INFO L93 Difference]: Finished difference Result 4708 states and 7945 transitions. [2025-02-05 17:18:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:09,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:09,688 INFO L225 Difference]: With dead ends: 4708 [2025-02-05 17:18:09,688 INFO L226 Difference]: Without dead ends: 3789 [2025-02-05 17:18:09,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:18:09,694 INFO L435 NwaCegarLoop]: 4599 mSDtfsCounter, 4862 mSDsluCounter, 13849 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4879 SdHoareTripleChecker+Valid, 18448 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:09,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4879 Valid, 18448 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:18:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2025-02-05 17:18:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3681. [2025-02-05 17:18:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3548 states have (on average 1.7294250281848929) internal successors, (6136), 3556 states have internal predecessors, (6136), 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-02-05 17:18:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6342 transitions. [2025-02-05 17:18:09,909 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6342 transitions. Word has length 145 [2025-02-05 17:18:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:09,910 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 6342 transitions. [2025-02-05 17:18:09,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6342 transitions. [2025-02-05 17:18:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:09,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:09,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:09,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:18:09,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:09,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1632702213, now seen corresponding path program 1 times [2025-02-05 17:18:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:09,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544826363] [2025-02-05 17:18:09,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:09,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:09,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:09,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:09,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:09,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:10,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-02-05 17:18:10,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544826363] [2025-02-05 17:18:10,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544826363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:10,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:10,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:10,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919212492] [2025-02-05 17:18:10,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:10,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:10,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:10,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:10,120 INFO L87 Difference]: Start difference. First operand 3681 states and 6342 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:10,937 INFO L93 Difference]: Finished difference Result 6700 states and 11060 transitions. [2025-02-05 17:18:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:10,968 INFO L225 Difference]: With dead ends: 6700 [2025-02-05 17:18:10,969 INFO L226 Difference]: Without dead ends: 5157 [2025-02-05 17:18:10,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:18:10,977 INFO L435 NwaCegarLoop]: 4596 mSDtfsCounter, 4857 mSDsluCounter, 13840 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4874 SdHoareTripleChecker+Valid, 18436 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:10,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4874 Valid, 18436 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:18:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2025-02-05 17:18:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 5022. [2025-02-05 17:18:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5022 states, 4779 states have (on average 1.6840343168026783) internal successors, (8048), 4801 states have internal predecessors, (8048), 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-02-05 17:18:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 8446 transitions. [2025-02-05 17:18:11,187 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 8446 transitions. Word has length 145 [2025-02-05 17:18:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:11,188 INFO L471 AbstractCegarLoop]: Abstraction has 5022 states and 8446 transitions. [2025-02-05 17:18:11,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 8446 transitions. [2025-02-05 17:18:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:11,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:11,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:11,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:18:11,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:11,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash -31536166, now seen corresponding path program 1 times [2025-02-05 17:18:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160505978] [2025-02-05 17:18:11,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:11,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:11,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:11,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:11,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160505978] [2025-02-05 17:18:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160505978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:11,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613273639] [2025-02-05 17:18:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:11,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:11,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:11,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:11,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:11,411 INFO L87 Difference]: Start difference. First operand 5022 states and 8446 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:12,278 INFO L93 Difference]: Finished difference Result 11037 states and 18038 transitions. [2025-02-05 17:18:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:12,337 INFO L225 Difference]: With dead ends: 11037 [2025-02-05 17:18:12,337 INFO L226 Difference]: Without dead ends: 8153 [2025-02-05 17:18:12,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:18:12,351 INFO L435 NwaCegarLoop]: 4593 mSDtfsCounter, 4852 mSDsluCounter, 13831 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4869 SdHoareTripleChecker+Valid, 18424 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:12,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4869 Valid, 18424 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:18:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8153 states. [2025-02-05 17:18:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8153 to 7965. [2025-02-05 17:18:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.6483164083377873) internal successors, (12336), 7552 states have internal predecessors, (12336), 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-02-05 17:18:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13214 transitions. [2025-02-05 17:18:12,814 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13214 transitions. Word has length 145 [2025-02-05 17:18:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:12,816 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13214 transitions. [2025-02-05 17:18:12,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13214 transitions. [2025-02-05 17:18:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:12,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:12,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:12,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:18:12,831 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:12,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -672622309, now seen corresponding path program 1 times [2025-02-05 17:18:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:12,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779547170] [2025-02-05 17:18:12,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:12,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:12,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:12,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:12,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:12,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:13,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779547170] [2025-02-05 17:18:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779547170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67811460] [2025-02-05 17:18:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:13,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:13,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:13,062 INFO L87 Difference]: Start difference. First operand 7965 states and 13214 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:13,688 INFO L93 Difference]: Finished difference Result 14954 states and 24808 transitions. [2025-02-05 17:18:13,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:13,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:13,737 INFO L225 Difference]: With dead ends: 14954 [2025-02-05 17:18:13,737 INFO L226 Difference]: Without dead ends: 9127 [2025-02-05 17:18:13,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:13,762 INFO L435 NwaCegarLoop]: 4320 mSDtfsCounter, 4606 mSDsluCounter, 8516 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4623 SdHoareTripleChecker+Valid, 12836 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:13,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4623 Valid, 12836 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2025-02-05 17:18:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 7965. [2025-02-05 17:18:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.646044895777659) internal successors, (12319), 7552 states have internal predecessors, (12319), 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-02-05 17:18:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13197 transitions. [2025-02-05 17:18:14,141 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13197 transitions. Word has length 145 [2025-02-05 17:18:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:14,142 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13197 transitions. [2025-02-05 17:18:14,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13197 transitions. [2025-02-05 17:18:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:14,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:14,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:14,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:18:14,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash 553623482, now seen corresponding path program 1 times [2025-02-05 17:18:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:14,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042931148] [2025-02-05 17:18:14,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:14,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:14,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:14,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:14,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042931148] [2025-02-05 17:18:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042931148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:14,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:14,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27581715] [2025-02-05 17:18:14,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:14,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:14,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:14,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:14,284 INFO L87 Difference]: Start difference. First operand 7965 states and 13197 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:14,854 INFO L93 Difference]: Finished difference Result 14871 states and 24608 transitions. [2025-02-05 17:18:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:14,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:14,896 INFO L225 Difference]: With dead ends: 14871 [2025-02-05 17:18:14,897 INFO L226 Difference]: Without dead ends: 9044 [2025-02-05 17:18:14,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:14,918 INFO L435 NwaCegarLoop]: 4317 mSDtfsCounter, 4603 mSDsluCounter, 8511 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 12828 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:14,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 12828 Invalid, 390 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9044 states. [2025-02-05 17:18:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9044 to 7965. [2025-02-05 17:18:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.6437733832175307) internal successors, (12302), 7552 states have internal predecessors, (12302), 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-02-05 17:18:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13180 transitions. [2025-02-05 17:18:15,269 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13180 transitions. Word has length 145 [2025-02-05 17:18:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:15,269 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13180 transitions. [2025-02-05 17:18:15,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13180 transitions. [2025-02-05 17:18:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:15,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:15,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:15,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:18:15,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:15,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1840105787, now seen corresponding path program 1 times [2025-02-05 17:18:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:15,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849442307] [2025-02-05 17:18:15,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:15,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:15,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:15,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:15,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:15,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849442307] [2025-02-05 17:18:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849442307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:15,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:15,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:15,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093691875] [2025-02-05 17:18:15,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:15,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:15,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:15,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:15,565 INFO L87 Difference]: Start difference. First operand 7965 states and 13180 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:16,942 INFO L93 Difference]: Finished difference Result 20496 states and 33714 transitions. [2025-02-05 17:18:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:17,003 INFO L225 Difference]: With dead ends: 20496 [2025-02-05 17:18:17,003 INFO L226 Difference]: Without dead ends: 14669 [2025-02-05 17:18:17,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:18:17,027 INFO L435 NwaCegarLoop]: 4580 mSDtfsCounter, 4831 mSDsluCounter, 13794 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4848 SdHoareTripleChecker+Valid, 18374 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.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:17,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4848 Valid, 18374 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:18:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14669 states. [2025-02-05 17:18:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14669 to 14418. [2025-02-05 17:18:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14418 states, 13407 states have (on average 1.6267621391810247) internal successors, (21810), 13621 states have internal predecessors, (21810), 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-02-05 17:18:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 24032 transitions. [2025-02-05 17:18:17,583 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 24032 transitions. Word has length 145 [2025-02-05 17:18:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:17,584 INFO L471 AbstractCegarLoop]: Abstraction has 14418 states and 24032 transitions. [2025-02-05 17:18:17,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 24032 transitions. [2025-02-05 17:18:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:17,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:17,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:17,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:18:17,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:17,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -473699430, now seen corresponding path program 1 times [2025-02-05 17:18:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881946516] [2025-02-05 17:18:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:17,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:17,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:17,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:17,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881946516] [2025-02-05 17:18:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881946516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395283621] [2025-02-05 17:18:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:17,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:17,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:17,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:17,741 INFO L87 Difference]: Start difference. First operand 14418 states and 24032 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:19,564 INFO L93 Difference]: Finished difference Result 43889 states and 74349 transitions. [2025-02-05 17:18:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:19,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:19,683 INFO L225 Difference]: With dead ends: 43889 [2025-02-05 17:18:19,683 INFO L226 Difference]: Without dead ends: 31609 [2025-02-05 17:18:19,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:18:19,714 INFO L435 NwaCegarLoop]: 4575 mSDtfsCounter, 5110 mSDsluCounter, 13774 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5137 SdHoareTripleChecker+Valid, 18349 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-02-05 17:18:19,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5137 Valid, 18349 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:18:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31609 states. [2025-02-05 17:18:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31609 to 28929. [2025-02-05 17:18:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28929 states, 26728 states have (on average 1.6335677940736306) internal successors, (43662), 27396 states have internal predecessors, (43662), 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-02-05 17:18:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28929 states to 28929 states and 50044 transitions. [2025-02-05 17:18:21,575 INFO L78 Accepts]: Start accepts. Automaton has 28929 states and 50044 transitions. Word has length 145 [2025-02-05 17:18:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:21,576 INFO L471 AbstractCegarLoop]: Abstraction has 28929 states and 50044 transitions. [2025-02-05 17:18:21,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28929 states and 50044 transitions. [2025-02-05 17:18:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:21,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:21,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:21,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:18:21,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1656716965, now seen corresponding path program 1 times [2025-02-05 17:18:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:21,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115092807] [2025-02-05 17:18:21,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:21,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:21,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:21,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:21,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:21,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115092807] [2025-02-05 17:18:21,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115092807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:21,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:21,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756965373] [2025-02-05 17:18:21,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:21,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:21,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:21,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:21,750 INFO L87 Difference]: Start difference. First operand 28929 states and 50044 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:24,901 INFO L93 Difference]: Finished difference Result 92808 states and 167267 transitions. [2025-02-05 17:18:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:24,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:25,303 INFO L225 Difference]: With dead ends: 92808 [2025-02-05 17:18:25,303 INFO L226 Difference]: Without dead ends: 66017 [2025-02-05 17:18:25,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:18:25,420 INFO L435 NwaCegarLoop]: 4568 mSDtfsCounter, 5042 mSDsluCounter, 13755 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5069 SdHoareTripleChecker+Valid, 18323 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-02-05 17:18:25,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5069 Valid, 18323 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:18:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66017 states. [2025-02-05 17:18:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66017 to 61743. [2025-02-05 17:18:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61743 states, 56708 states have (on average 1.65034915708542) internal successors, (93588), 58770 states have internal predecessors, (93588), 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-02-05 17:18:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61743 states to 61743 states and 114370 transitions. [2025-02-05 17:18:29,271 INFO L78 Accepts]: Start accepts. Automaton has 61743 states and 114370 transitions. Word has length 145 [2025-02-05 17:18:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:29,272 INFO L471 AbstractCegarLoop]: Abstraction has 61743 states and 114370 transitions. [2025-02-05 17:18:29,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 61743 states and 114370 transitions. [2025-02-05 17:18:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:29,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:29,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:29,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:18:29,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1354339164, now seen corresponding path program 1 times [2025-02-05 17:18:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065328600] [2025-02-05 17:18:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:29,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:29,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:29,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:29,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:29,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065328600] [2025-02-05 17:18:29,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065328600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:29,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068264256] [2025-02-05 17:18:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:29,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:29,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:29,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:29,496 INFO L87 Difference]: Start difference. First operand 61743 states and 114370 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:33,104 INFO L93 Difference]: Finished difference Result 138860 states and 269854 transitions. [2025-02-05 17:18:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:33,559 INFO L225 Difference]: With dead ends: 138860 [2025-02-05 17:18:33,559 INFO L226 Difference]: Without dead ends: 79255 [2025-02-05 17:18:33,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:33,755 INFO L435 NwaCegarLoop]: 4306 mSDtfsCounter, 4594 mSDsluCounter, 8488 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 12794 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:33,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 12794 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:33,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79255 states. [2025-02-05 17:18:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79255 to 61743. [2025-02-05 17:18:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61743 states, 56708 states have (on average 1.6480743457713198) internal successors, (93459), 58770 states have internal predecessors, (93459), 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-02-05 17:18:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61743 states to 61743 states and 114241 transitions. [2025-02-05 17:18:37,083 INFO L78 Accepts]: Start accepts. Automaton has 61743 states and 114241 transitions. Word has length 145 [2025-02-05 17:18:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:37,084 INFO L471 AbstractCegarLoop]: Abstraction has 61743 states and 114241 transitions. [2025-02-05 17:18:37,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 61743 states and 114241 transitions. [2025-02-05 17:18:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:37,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:37,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:37,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:18:37,110 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:37,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:37,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1590017339, now seen corresponding path program 1 times [2025-02-05 17:18:37,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:37,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488633165] [2025-02-05 17:18:37,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:37,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:37,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:37,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:37,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:37,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488633165] [2025-02-05 17:18:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488633165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:37,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:37,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598641722] [2025-02-05 17:18:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:37,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:37,253 INFO L87 Difference]: Start difference. First operand 61743 states and 114241 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:40,639 INFO L93 Difference]: Finished difference Result 136671 states and 265218 transitions. [2025-02-05 17:18:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:41,073 INFO L225 Difference]: With dead ends: 136671 [2025-02-05 17:18:41,073 INFO L226 Difference]: Without dead ends: 77066 [2025-02-05 17:18:41,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:41,244 INFO L435 NwaCegarLoop]: 4303 mSDtfsCounter, 4591 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 12786 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:41,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 12786 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77066 states. [2025-02-05 17:18:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77066 to 61743. [2025-02-05 17:18:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61743 states, 56708 states have (on average 1.6457995344572194) internal successors, (93330), 58770 states have internal predecessors, (93330), 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-02-05 17:18:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61743 states to 61743 states and 114112 transitions. [2025-02-05 17:18:46,745 INFO L78 Accepts]: Start accepts. Automaton has 61743 states and 114112 transitions. Word has length 145 [2025-02-05 17:18:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:46,745 INFO L471 AbstractCegarLoop]: Abstraction has 61743 states and 114112 transitions. [2025-02-05 17:18:46,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 61743 states and 114112 transitions. [2025-02-05 17:18:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:18:46,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:46,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:46,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:18:46,762 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:46,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash 766335868, now seen corresponding path program 1 times [2025-02-05 17:18:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:46,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346266301] [2025-02-05 17:18:46,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:46,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:18:46,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:18:46,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:46,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346266301] [2025-02-05 17:18:46,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346266301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:46,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:46,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700510660] [2025-02-05 17:18:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:46,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:46,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:46,894 INFO L87 Difference]: Start difference. First operand 61743 states and 114112 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:52,196 INFO L93 Difference]: Finished difference Result 198762 states and 394537 transitions. [2025-02-05 17:18:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:52,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:18:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:52,804 INFO L225 Difference]: With dead ends: 198762 [2025-02-05 17:18:52,804 INFO L226 Difference]: Without dead ends: 139157 [2025-02-05 17:18:52,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:18:52,939 INFO L435 NwaCegarLoop]: 4555 mSDtfsCounter, 4931 mSDsluCounter, 13718 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4958 SdHoareTripleChecker+Valid, 18273 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-02-05 17:18:52,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4958 Valid, 18273 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:18:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139157 states.