./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaf13b6417c3a40bd252c0d41a10a8dacb34259e9c2292b8e82d477fe2508ef5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:07:49,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:07:49,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:07:49,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:07:49,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:07:49,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:07:49,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:07:49,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:07:49,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:07:49,818 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:07:49,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:07:49,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:07:49,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:07:49,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:07:49,820 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:07:49,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:07:49,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:07:49,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:07:49,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:07:49,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:07:49,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:07:49,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:07:49,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:07:49,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:07:49,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:07:49,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:07:49,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:07:49,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:07:49,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:07:49,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:07:49,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:07:49,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:07:49,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:07:49,823 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaf13b6417c3a40bd252c0d41a10a8dacb34259e9c2292b8e82d477fe2508ef5 [2025-03-16 20:07:50,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:07:50,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:07:50,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:07:50,037 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:07:50,038 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:07:50,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c [2025-03-16 20:07:51,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3366605bd/a0f678c1cada4b09af77e9fd3c172f51/FLAGe85e41535 [2025-03-16 20:07:51,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:07:51,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c [2025-03-16 20:07:51,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3366605bd/a0f678c1cada4b09af77e9fd3c172f51/FLAGe85e41535 [2025-03-16 20:07:51,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3366605bd/a0f678c1cada4b09af77e9fd3c172f51 [2025-03-16 20:07:51,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:07:51,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:07:51,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:07:51,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:07:51,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:07:51,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:07:51" (1/1) ... [2025-03-16 20:07:51,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f81a443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:51, skipping insertion in model container [2025-03-16 20:07:51,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:07:51" (1/1) ... [2025-03-16 20:07:51,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:07:53,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c[380593,380606] [2025-03-16 20:07:53,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c[383339,383352] [2025-03-16 20:07:53,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:07:53,353 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:07:53,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c[380593,380606] [2025-03-16 20:07:53,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c[383339,383352] [2025-03-16 20:07:53,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:07:54,009 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:07:54,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54 WrapperNode [2025-03-16 20:07:54,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:07:54,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:07:54,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:07:54,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:07:54,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,396 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12963 [2025-03-16 20:07:54,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:07:54,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:07:54,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:07:54,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:07:54,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,590 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:07:54,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:07:54,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:07:54,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:07:54,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:07:54,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (1/1) ... [2025-03-16 20:07:54,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:07:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:54,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:07:54,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:07:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:07:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:07:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:07:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:07:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:07:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:07:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:07:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:07:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:07:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:07:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:07:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:07:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:07:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:07:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:07:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:07:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:07:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:07:55,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:07:55,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:08:01,054 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:08:01,055 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:08:01,056 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:08:01,056 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:08:01,057 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:08:01,057 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:08:01,057 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:08:01,314 INFO L? ?]: Removed 1724 outVars from TransFormulas that were not future-live. [2025-03-16 20:08:01,315 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:08:01,370 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:08:01,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:08:01,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:08:01 BoogieIcfgContainer [2025-03-16 20:08:01,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:08:01,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:08:01,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:08:01,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:08:01,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:07:51" (1/3) ... [2025-03-16 20:08:01,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4178492f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:08:01, skipping insertion in model container [2025-03-16 20:08:01,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:54" (2/3) ... [2025-03-16 20:08:01,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4178492f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:08:01, skipping insertion in model container [2025-03-16 20:08:01,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:08:01" (3/3) ... [2025-03-16 20:08:01,382 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.08.cil-2.c [2025-03-16 20:08:01,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:08:01,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.08.cil-2.c that has 8 procedures, 2397 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-16 20:08:01,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:08:01,504 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;@1c80e594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:08:01,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:08:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 2397 states, 2364 states have (on average 1.870135363790186) internal successors, (4421), 2368 states have internal predecessors, (4421), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 20:08:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:01,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:01,529 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] [2025-03-16 20:08:01,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:01,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 798441018, now seen corresponding path program 1 times [2025-03-16 20:08:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874865830] [2025-03-16 20:08:01,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:01,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:01,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:01,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:01,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:01,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874865830] [2025-03-16 20:08:01,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874865830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:01,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:08:01,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532563297] [2025-03-16 20:08:01,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:01,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:08:01,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:01,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:08:01,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:01,887 INFO L87 Difference]: Start difference. First operand has 2397 states, 2364 states have (on average 1.870135363790186) internal successors, (4421), 2368 states have internal predecessors, (4421), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:02,059 INFO L93 Difference]: Finished difference Result 4789 states and 8929 transitions. [2025-03-16 20:08:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:08:02,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:02,087 INFO L225 Difference]: With dead ends: 4789 [2025-03-16 20:08:02,088 INFO L226 Difference]: Without dead ends: 2390 [2025-03-16 20:08:02,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:02,098 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 427 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 8353 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:02,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 8353 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:08:02,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2025-03-16 20:08:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2025-03-16 20:08:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2358 states have (on average 1.8401187446988974) internal successors, (4339), 2361 states have internal predecessors, (4339), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 20:08:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 4385 transitions. [2025-03-16 20:08:02,221 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 4385 transitions. Word has length 122 [2025-03-16 20:08:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:02,222 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 4385 transitions. [2025-03-16 20:08:02,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 4385 transitions. [2025-03-16 20:08:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:02,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:02,225 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] [2025-03-16 20:08:02,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:08:02,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:02,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1981458553, now seen corresponding path program 1 times [2025-03-16 20:08:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244550072] [2025-03-16 20:08:02,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:02,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:02,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:02,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:02,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244550072] [2025-03-16 20:08:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244550072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021865396] [2025-03-16 20:08:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:02,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:02,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:02,481 INFO L87 Difference]: Start difference. First operand 2390 states and 4385 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:02,997 INFO L93 Difference]: Finished difference Result 2933 states and 5258 transitions. [2025-03-16 20:08:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:08:02,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:02,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:03,009 INFO L225 Difference]: With dead ends: 2933 [2025-03-16 20:08:03,009 INFO L226 Difference]: Without dead ends: 2678 [2025-03-16 20:08:03,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:03,011 INFO L435 NwaCegarLoop]: 4295 mSDtfsCounter, 4752 mSDsluCounter, 8769 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4768 SdHoareTripleChecker+Valid, 13064 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:03,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4768 Valid, 13064 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:08:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-03-16 20:08:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2655. [2025-03-16 20:08:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2599 states have (on average 1.819545979222778) internal successors, (4729), 2603 states have internal predecessors, (4729), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 20:08:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4810 transitions. [2025-03-16 20:08:03,075 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4810 transitions. Word has length 122 [2025-03-16 20:08:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:03,078 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4810 transitions. [2025-03-16 20:08:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4810 transitions. [2025-03-16 20:08:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:03,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:03,080 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] [2025-03-16 20:08:03,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:08:03,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:03,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash -303987751, now seen corresponding path program 1 times [2025-03-16 20:08:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:03,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966444071] [2025-03-16 20:08:03,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:03,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:03,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:03,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:03,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:03,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:03,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966444071] [2025-03-16 20:08:03,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966444071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:03,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:03,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:03,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202517929] [2025-03-16 20:08:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:03,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:03,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:03,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:03,255 INFO L87 Difference]: Start difference. First operand 2655 states and 4810 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:03,550 INFO L93 Difference]: Finished difference Result 3229 states and 5744 transitions. [2025-03-16 20:08:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:03,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:03,561 INFO L225 Difference]: With dead ends: 3229 [2025-03-16 20:08:03,562 INFO L226 Difference]: Without dead ends: 2709 [2025-03-16 20:08:03,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:03,566 INFO L435 NwaCegarLoop]: 4285 mSDtfsCounter, 4525 mSDsluCounter, 8451 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4541 SdHoareTripleChecker+Valid, 12736 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:03,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4541 Valid, 12736 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2025-03-16 20:08:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2655. [2025-03-16 20:08:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2599 states have (on average 1.8187764524817238) internal successors, (4727), 2603 states have internal predecessors, (4727), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 20:08:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4808 transitions. [2025-03-16 20:08:03,631 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4808 transitions. Word has length 122 [2025-03-16 20:08:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:03,631 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4808 transitions. [2025-03-16 20:08:03,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4808 transitions. [2025-03-16 20:08:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:03,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:03,633 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] [2025-03-16 20:08:03,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:08:03,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash 390659256, now seen corresponding path program 1 times [2025-03-16 20:08:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19939265] [2025-03-16 20:08:03,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:03,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:03,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:03,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:03,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19939265] [2025-03-16 20:08:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19939265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337033244] [2025-03-16 20:08:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:03,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:03,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:03,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:03,876 INFO L87 Difference]: Start difference. First operand 2655 states and 4808 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:04,611 INFO L93 Difference]: Finished difference Result 3511 states and 6189 transitions. [2025-03-16 20:08:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:04,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:04,625 INFO L225 Difference]: With dead ends: 3511 [2025-03-16 20:08:04,625 INFO L226 Difference]: Without dead ends: 2991 [2025-03-16 20:08:04,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:04,629 INFO L435 NwaCegarLoop]: 4524 mSDtfsCounter, 4745 mSDsluCounter, 13588 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 18112 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:04,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 18112 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2025-03-16 20:08:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2900. [2025-03-16 20:08:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2820 states have (on average 1.8) internal successors, (5076), 2825 states have internal predecessors, (5076), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-16 20:08:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 5194 transitions. [2025-03-16 20:08:04,715 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 5194 transitions. Word has length 122 [2025-03-16 20:08:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:04,715 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 5194 transitions. [2025-03-16 20:08:04,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 5194 transitions. [2025-03-16 20:08:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:04,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:04,718 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] [2025-03-16 20:08:04,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:08:04,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:04,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1521445881, now seen corresponding path program 1 times [2025-03-16 20:08:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713889509] [2025-03-16 20:08:04,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:04,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:04,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:04,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:04,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:04,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:04,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713889509] [2025-03-16 20:08:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713889509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:04,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:04,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580990288] [2025-03-16 20:08:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:04,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:04,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:04,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:04,848 INFO L87 Difference]: Start difference. First operand 2900 states and 5194 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:05,368 INFO L93 Difference]: Finished difference Result 4289 states and 7432 transitions. [2025-03-16 20:08:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:05,381 INFO L225 Difference]: With dead ends: 4289 [2025-03-16 20:08:05,381 INFO L226 Difference]: Without dead ends: 3524 [2025-03-16 20:08:05,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:05,385 INFO L435 NwaCegarLoop]: 4318 mSDtfsCounter, 4765 mSDsluCounter, 13099 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 17417 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:05,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4781 Valid, 17417 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:08:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2025-03-16 20:08:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3421. [2025-03-16 20:08:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3291 states have (on average 1.7711941659070192) internal successors, (5829), 3300 states have internal predecessors, (5829), 92 states have call successors, (92), 31 states have call predecessors, (92), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-16 20:08:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 6027 transitions. [2025-03-16 20:08:05,467 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 6027 transitions. Word has length 122 [2025-03-16 20:08:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:05,467 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 6027 transitions. [2025-03-16 20:08:05,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 6027 transitions. [2025-03-16 20:08:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:05,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:05,473 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] [2025-03-16 20:08:05,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:08:05,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:05,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash 588091544, now seen corresponding path program 1 times [2025-03-16 20:08:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:05,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676690186] [2025-03-16 20:08:05,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:05,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:05,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:05,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:05,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:05,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:05,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:05,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676690186] [2025-03-16 20:08:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676690186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:05,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:05,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:05,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647877628] [2025-03-16 20:08:05,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:05,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:05,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:05,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:05,624 INFO L87 Difference]: Start difference. First operand 3421 states and 6027 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:06,188 INFO L93 Difference]: Finished difference Result 5964 states and 10159 transitions. [2025-03-16 20:08:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:06,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:06,205 INFO L225 Difference]: With dead ends: 5964 [2025-03-16 20:08:06,205 INFO L226 Difference]: Without dead ends: 4678 [2025-03-16 20:08:06,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:06,210 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 4735 mSDsluCounter, 13567 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4751 SdHoareTripleChecker+Valid, 18084 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:06,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4751 Valid, 18084 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:08:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4678 states. [2025-03-16 20:08:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4678 to 4550. [2025-03-16 20:08:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 4314 states have (on average 1.7359758924432083) internal successors, (7489), 4337 states have internal predecessors, (7489), 160 states have call successors, (160), 55 states have call predecessors, (160), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-16 20:08:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 7871 transitions. [2025-03-16 20:08:06,336 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 7871 transitions. Word has length 122 [2025-03-16 20:08:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:06,337 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 7871 transitions. [2025-03-16 20:08:06,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 7871 transitions. [2025-03-16 20:08:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:06,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:06,339 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] [2025-03-16 20:08:06,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:08:06,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:06,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2082003993, now seen corresponding path program 1 times [2025-03-16 20:08:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:06,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568629401] [2025-03-16 20:08:06,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:06,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:06,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:06,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:06,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:06,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568629401] [2025-03-16 20:08:06,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568629401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:06,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:06,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:06,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899721000] [2025-03-16 20:08:06,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:06,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:06,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:06,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:06,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:06,446 INFO L87 Difference]: Start difference. First operand 4550 states and 7871 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:07,071 INFO L93 Difference]: Finished difference Result 9643 states and 16313 transitions. [2025-03-16 20:08:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:07,100 INFO L225 Difference]: With dead ends: 9643 [2025-03-16 20:08:07,100 INFO L226 Difference]: Without dead ends: 7228 [2025-03-16 20:08:07,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:07,110 INFO L435 NwaCegarLoop]: 4514 mSDtfsCounter, 4730 mSDsluCounter, 13558 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4746 SdHoareTripleChecker+Valid, 18072 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:07,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4746 Valid, 18072 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:08:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7228 states. [2025-03-16 20:08:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 7051. [2025-03-16 20:08:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7051 states, 6585 states have (on average 1.7064540622627182) internal successors, (11237), 6654 states have internal predecessors, (11237), 296 states have call successors, (296), 103 states have call predecessors, (296), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-16 20:08:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 12083 transitions. [2025-03-16 20:08:07,332 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 12083 transitions. Word has length 122 [2025-03-16 20:08:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:07,332 INFO L471 AbstractCegarLoop]: Abstraction has 7051 states and 12083 transitions. [2025-03-16 20:08:07,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 12083 transitions. [2025-03-16 20:08:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:07,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:07,336 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] [2025-03-16 20:08:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:08:07,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash 883268728, now seen corresponding path program 1 times [2025-03-16 20:08:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193396584] [2025-03-16 20:08:07,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:07,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:07,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:07,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:07,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:07,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193396584] [2025-03-16 20:08:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193396584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:07,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:07,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:07,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811577152] [2025-03-16 20:08:07,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:07,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:07,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:07,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:07,451 INFO L87 Difference]: Start difference. First operand 7051 states and 12083 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:08,391 INFO L93 Difference]: Finished difference Result 17914 states and 30699 transitions. [2025-03-16 20:08:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:08,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:08,440 INFO L225 Difference]: With dead ends: 17914 [2025-03-16 20:08:08,441 INFO L226 Difference]: Without dead ends: 12998 [2025-03-16 20:08:08,461 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-03-16 20:08:08,462 INFO L435 NwaCegarLoop]: 4511 mSDtfsCounter, 4725 mSDsluCounter, 13549 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4741 SdHoareTripleChecker+Valid, 18060 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:08,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4741 Valid, 18060 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12998 states. [2025-03-16 20:08:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12998 to 12728. [2025-03-16 20:08:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6950119169220292) internal successors, (19913), 11963 states have internal predecessors, (19913), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 20:08:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22071 transitions. [2025-03-16 20:08:08,979 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22071 transitions. Word has length 122 [2025-03-16 20:08:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:08,979 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22071 transitions. [2025-03-16 20:08:08,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22071 transitions. [2025-03-16 20:08:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:08,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:08,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] [2025-03-16 20:08:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:08:08,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1398789177, now seen corresponding path program 1 times [2025-03-16 20:08:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237366955] [2025-03-16 20:08:08,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:08,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:09,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:09,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:09,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237366955] [2025-03-16 20:08:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237366955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:09,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:09,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810559355] [2025-03-16 20:08:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:09,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:09,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:09,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:09,083 INFO L87 Difference]: Start difference. First operand 12728 states and 22071 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:09,934 INFO L93 Difference]: Finished difference Result 26261 states and 46397 transitions. [2025-03-16 20:08:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:09,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:09,995 INFO L225 Difference]: With dead ends: 26261 [2025-03-16 20:08:09,995 INFO L226 Difference]: Without dead ends: 15668 [2025-03-16 20:08:10,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:10,031 INFO L435 NwaCegarLoop]: 4272 mSDtfsCounter, 4517 mSDsluCounter, 8426 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 12698 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:10,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4533 Valid, 12698 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15668 states. [2025-03-16 20:08:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15668 to 12728. [2025-03-16 20:08:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6922029281579842) internal successors, (19880), 11963 states have internal predecessors, (19880), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 20:08:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22038 transitions. [2025-03-16 20:08:10,548 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22038 transitions. Word has length 122 [2025-03-16 20:08:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:10,548 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22038 transitions. [2025-03-16 20:08:10,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22038 transitions. [2025-03-16 20:08:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:10,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:10,555 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] [2025-03-16 20:08:10,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:08:10,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:10,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash 445587544, now seen corresponding path program 1 times [2025-03-16 20:08:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:10,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450137143] [2025-03-16 20:08:10,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:10,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:10,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:10,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:10,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450137143] [2025-03-16 20:08:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450137143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:10,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:10,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654554766] [2025-03-16 20:08:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:10,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:10,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:10,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:10,640 INFO L87 Difference]: Start difference. First operand 12728 states and 22038 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:11,172 INFO L93 Difference]: Finished difference Result 26016 states and 45841 transitions. [2025-03-16 20:08:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:11,219 INFO L225 Difference]: With dead ends: 26016 [2025-03-16 20:08:11,219 INFO L226 Difference]: Without dead ends: 15423 [2025-03-16 20:08:11,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:11,240 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4514 mSDsluCounter, 8421 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4530 SdHoareTripleChecker+Valid, 12690 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:11,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4530 Valid, 12690 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15423 states. [2025-03-16 20:08:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15423 to 12728. [2025-03-16 20:08:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6893939393939394) internal successors, (19847), 11963 states have internal predecessors, (19847), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 20:08:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22005 transitions. [2025-03-16 20:08:11,725 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22005 transitions. Word has length 122 [2025-03-16 20:08:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:11,726 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22005 transitions. [2025-03-16 20:08:11,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22005 transitions. [2025-03-16 20:08:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:11,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:11,733 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] [2025-03-16 20:08:11,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:08:11,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:11,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1246123097, now seen corresponding path program 1 times [2025-03-16 20:08:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:11,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212218952] [2025-03-16 20:08:11,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:11,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:11,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:11,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:11,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:11,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212218952] [2025-03-16 20:08:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212218952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237533345] [2025-03-16 20:08:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:11,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:11,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:11,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:11,936 INFO L87 Difference]: Start difference. First operand 12728 states and 22005 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:13,020 INFO L93 Difference]: Finished difference Result 38089 states and 67148 transitions. [2025-03-16 20:08:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:13,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:13,099 INFO L225 Difference]: With dead ends: 38089 [2025-03-16 20:08:13,100 INFO L226 Difference]: Without dead ends: 27496 [2025-03-16 20:08:13,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:13,130 INFO L435 NwaCegarLoop]: 4496 mSDtfsCounter, 4931 mSDsluCounter, 13501 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4956 SdHoareTripleChecker+Valid, 17997 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:13,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4956 Valid, 17997 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27496 states. [2025-03-16 20:08:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27496 to 25363. [2025-03-16 20:08:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25363 states, 23225 states have (on average 1.6931324004305706) internal successors, (39323), 23894 states have internal predecessors, (39323), 1080 states have call successors, (1080), 391 states have call predecessors, (1080), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 20:08:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25363 states to 25363 states and 45577 transitions. [2025-03-16 20:08:14,239 INFO L78 Accepts]: Start accepts. Automaton has 25363 states and 45577 transitions. Word has length 122 [2025-03-16 20:08:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:14,240 INFO L471 AbstractCegarLoop]: Abstraction has 25363 states and 45577 transitions. [2025-03-16 20:08:14,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 25363 states and 45577 transitions. [2025-03-16 20:08:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:14,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:14,251 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] [2025-03-16 20:08:14,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:08:14,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 717757496, now seen corresponding path program 1 times [2025-03-16 20:08:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342327603] [2025-03-16 20:08:14,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:14,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:14,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:14,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:14,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:14,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342327603] [2025-03-16 20:08:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342327603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:14,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:14,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814192429] [2025-03-16 20:08:14,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:14,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:14,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:14,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:14,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:14,334 INFO L87 Difference]: Start difference. First operand 25363 states and 45577 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:15,433 INFO L93 Difference]: Finished difference Result 55170 states and 102365 transitions. [2025-03-16 20:08:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:15,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:15,545 INFO L225 Difference]: With dead ends: 55170 [2025-03-16 20:08:15,545 INFO L226 Difference]: Without dead ends: 31942 [2025-03-16 20:08:15,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:15,595 INFO L435 NwaCegarLoop]: 4264 mSDtfsCounter, 4508 mSDsluCounter, 8410 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 12674 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:15,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4524 Valid, 12674 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31942 states. [2025-03-16 20:08:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31942 to 25363. [2025-03-16 20:08:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25363 states, 23225 states have (on average 1.6903336921420882) internal successors, (39258), 23894 states have internal predecessors, (39258), 1080 states have call successors, (1080), 391 states have call predecessors, (1080), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 20:08:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25363 states to 25363 states and 45512 transitions. [2025-03-16 20:08:17,145 INFO L78 Accepts]: Start accepts. Automaton has 25363 states and 45512 transitions. Word has length 122 [2025-03-16 20:08:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:17,146 INFO L471 AbstractCegarLoop]: Abstraction has 25363 states and 45512 transitions. [2025-03-16 20:08:17,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 25363 states and 45512 transitions. [2025-03-16 20:08:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:17,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:17,155 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] [2025-03-16 20:08:17,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:08:17,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:17,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:17,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1393450105, now seen corresponding path program 1 times [2025-03-16 20:08:17,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:17,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108739396] [2025-03-16 20:08:17,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:17,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:17,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:17,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:17,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:17,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:17,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108739396] [2025-03-16 20:08:17,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108739396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:17,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:17,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:17,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219694942] [2025-03-16 20:08:17,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:17,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:17,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:17,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:17,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:17,257 INFO L87 Difference]: Start difference. First operand 25363 states and 45512 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:19,639 INFO L93 Difference]: Finished difference Result 80478 states and 151003 transitions. [2025-03-16 20:08:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:19,826 INFO L225 Difference]: With dead ends: 80478 [2025-03-16 20:08:19,826 INFO L226 Difference]: Without dead ends: 57250 [2025-03-16 20:08:19,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:19,876 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 4900 mSDsluCounter, 13033 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 17333 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:19,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 17333 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57250 states. [2025-03-16 20:08:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57250 to 53939. [2025-03-16 20:08:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.7008831147641288) internal successors, (83396), 51094 states have internal predecessors, (83396), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 20:08:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103922 transitions. [2025-03-16 20:08:22,313 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103922 transitions. Word has length 122 [2025-03-16 20:08:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:22,313 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103922 transitions. [2025-03-16 20:08:22,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103922 transitions. [2025-03-16 20:08:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:22,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:22,333 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] [2025-03-16 20:08:22,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:08:22,333 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:22,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash 583962648, now seen corresponding path program 1 times [2025-03-16 20:08:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:22,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092169387] [2025-03-16 20:08:22,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:22,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:22,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:22,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:22,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:22,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:22,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092169387] [2025-03-16 20:08:22,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092169387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:22,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:22,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426589021] [2025-03-16 20:08:22,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:22,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:22,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:22,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:22,428 INFO L87 Difference]: Start difference. First operand 53939 states and 103922 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:25,344 INFO L93 Difference]: Finished difference Result 121066 states and 244585 transitions. [2025-03-16 20:08:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:25,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:25,717 INFO L225 Difference]: With dead ends: 121066 [2025-03-16 20:08:25,717 INFO L226 Difference]: Without dead ends: 69262 [2025-03-16 20:08:25,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:25,805 INFO L435 NwaCegarLoop]: 4259 mSDtfsCounter, 4504 mSDsluCounter, 8401 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 12660 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:25,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 12660 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69262 states. [2025-03-16 20:08:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69262 to 53939. [2025-03-16 20:08:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.6982521262058698) internal successors, (83267), 51094 states have internal predecessors, (83267), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 20:08:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103793 transitions. [2025-03-16 20:08:29,225 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103793 transitions. Word has length 122 [2025-03-16 20:08:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:29,225 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103793 transitions. [2025-03-16 20:08:29,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103793 transitions. [2025-03-16 20:08:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:29,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:29,243 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] [2025-03-16 20:08:29,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:08:29,244 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:29,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash 142208153, now seen corresponding path program 1 times [2025-03-16 20:08:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:29,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224589064] [2025-03-16 20:08:29,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:29,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:29,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:29,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:29,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:29,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224589064] [2025-03-16 20:08:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224589064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:29,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601990007] [2025-03-16 20:08:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:29,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:29,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:29,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:29,323 INFO L87 Difference]: Start difference. First operand 53939 states and 103793 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:32,622 INFO L93 Difference]: Finished difference Result 118877 states and 239949 transitions. [2025-03-16 20:08:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:32,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:32,967 INFO L225 Difference]: With dead ends: 118877 [2025-03-16 20:08:32,967 INFO L226 Difference]: Without dead ends: 67073 [2025-03-16 20:08:33,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:33,313 INFO L435 NwaCegarLoop]: 4256 mSDtfsCounter, 4501 mSDsluCounter, 8396 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 12652 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:33,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 12652 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67073 states. [2025-03-16 20:08:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67073 to 53939. [2025-03-16 20:08:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.6956211376476107) internal successors, (83138), 51094 states have internal predecessors, (83138), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 20:08:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103664 transitions. [2025-03-16 20:08:38,348 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103664 transitions. Word has length 122 [2025-03-16 20:08:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:38,349 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103664 transitions. [2025-03-16 20:08:38,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103664 transitions. [2025-03-16 20:08:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:08:38,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:38,364 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] [2025-03-16 20:08:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:08:38,364 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:38,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 127958008, now seen corresponding path program 1 times [2025-03-16 20:08:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:38,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501767049] [2025-03-16 20:08:38,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:38,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:08:38,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:08:38,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:38,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501767049] [2025-03-16 20:08:38,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501767049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:38,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:38,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:38,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753807801] [2025-03-16 20:08:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:38,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:38,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:38,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:38,453 INFO L87 Difference]: Start difference. First operand 53939 states and 103664 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:42,926 INFO L93 Difference]: Finished difference Result 171684 states and 356713 transitions. [2025-03-16 20:08:42,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:42,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 20:08:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:43,532 INFO L225 Difference]: With dead ends: 171684 [2025-03-16 20:08:43,532 INFO L226 Difference]: Without dead ends: 119880 [2025-03-16 20:08:43,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:43,726 INFO L435 NwaCegarLoop]: 4475 mSDtfsCounter, 4762 mSDsluCounter, 13441 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 17916 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:43,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 17916 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:08:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119880 states.