./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.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-?-798a7b3-m [2025-03-03 15:48:50,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:48:50,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:48:50,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:48:50,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:48:50,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:48:50,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:48:50,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:48:50,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:48:50,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:48:50,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:48:50,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:48:50,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:48:50,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:48:50,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:48:50,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:48:50,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:48:50,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:48:50,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:48:50,576 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-03 15:48:50,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:48:50,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:48:50,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:48:50,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:48:50,815 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:48:50,816 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-03 15:48:51,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55486386a/6ea30aed3c594fb0aff00daecdb7a258/FLAG9339e45d1 [2025-03-03 15:48:52,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:48:52,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-2.c [2025-03-03 15:48:52,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55486386a/6ea30aed3c594fb0aff00daecdb7a258/FLAG9339e45d1 [2025-03-03 15:48:53,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55486386a/6ea30aed3c594fb0aff00daecdb7a258 [2025-03-03 15:48:53,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:48:53,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:48:53,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:48:53,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:48:53,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:48:53,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:48:53" (1/1) ... [2025-03-03 15:48:53,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427ace29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:53, skipping insertion in model container [2025-03-03 15:48:53,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:48:53" (1/1) ... [2025-03-03 15:48:53,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:48:54,224 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-03 15:48:54,265 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-03 15:48:54,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:48:54,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:48:55,002 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-03 15:48:55,006 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-03 15:48:55,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:48:55,072 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:48:55,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55 WrapperNode [2025-03-03 15:48:55,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:48:55,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:48:55,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:48:55,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:48:55,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,414 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12963 [2025-03-03 15:48:55,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:48:55,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:48:55,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:48:55,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:48:55,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,569 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:48:55,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:48:55,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:48:55,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:48:55,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:48:55,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (1/1) ... [2025-03-03 15:48:55,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:48:55,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:55,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:48:55,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:48:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:48:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:48:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:48:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:48:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:48:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:48:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:48:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 15:48:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 15:48:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:48:55,980 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:48:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:48:55,980 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:48:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:48:55,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:48:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:48:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:48:55,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:48:56,094 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:48:56,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:49:02,281 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:49:02,281 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:49:02,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:49:02,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:49:02,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:49:02,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:49:02,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:49:02,473 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2025-03-03 15:49:02,474 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:49:02,526 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:49:02,527 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:49:02,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:49:02 BoogieIcfgContainer [2025-03-03 15:49:02,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:49:02,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:49:02,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:49:02,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:49:02,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:48:53" (1/3) ... [2025-03-03 15:49:02,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7890a9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:49:02, skipping insertion in model container [2025-03-03 15:49:02,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:55" (2/3) ... [2025-03-03 15:49:02,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7890a9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:49:02, skipping insertion in model container [2025-03-03 15:49:02,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:49:02" (3/3) ... [2025-03-03 15:49:02,540 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.08.cil-2.c [2025-03-03 15:49:02,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:49:02,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.08.cil-2.c that has 8 procedures, 2491 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-03 15:49:02,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:49:02,644 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;@45041bf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:49:02,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:49:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 2491 states, 2457 states have (on average 1.8376068376068375) internal successors, (4515), 2462 states have internal predecessors, (4515), 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-03 15:49:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:02,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:02,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:02,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:02,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1770730538, now seen corresponding path program 1 times [2025-03-03 15:49:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155581311] [2025-03-03 15:49:02,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:02,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:02,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:02,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:02,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:03,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:03,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155581311] [2025-03-03 15:49:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155581311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:03,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:03,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055985363] [2025-03-03 15:49:03,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:03,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:03,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:03,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:03,177 INFO L87 Difference]: Start difference. First operand has 2491 states, 2457 states have (on average 1.8376068376068375) internal successors, (4515), 2462 states have internal predecessors, (4515), 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 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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-03 15:49:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:03,805 INFO L93 Difference]: Finished difference Result 5286 states and 9615 transitions. [2025-03-03 15:49:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:49:03,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:03,832 INFO L225 Difference]: With dead ends: 5286 [2025-03-03 15:49:03,832 INFO L226 Difference]: Without dead ends: 2741 [2025-03-03 15:49:03,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:03,849 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4868 mSDsluCounter, 8988 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4884 SdHoareTripleChecker+Valid, 13379 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:03,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4884 Valid, 13379 Invalid, 525 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:49:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2025-03-03 15:49:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2718. [2025-03-03 15:49:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2662 states have (on average 1.8005259203606312) internal successors, (4793), 2666 states have internal predecessors, (4793), 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-03 15:49:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 4874 transitions. [2025-03-03 15:49:03,988 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 4874 transitions. Word has length 135 [2025-03-03 15:49:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:03,989 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 4874 transitions. [2025-03-03 15:49:03,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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-03 15:49:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 4874 transitions. [2025-03-03 15:49:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:03,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:03,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:03,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:49:03,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:03,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1089729320, now seen corresponding path program 1 times [2025-03-03 15:49:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:03,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284759422] [2025-03-03 15:49:03,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:04,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:04,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:04,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:04,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:04,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:04,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284759422] [2025-03-03 15:49:04,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284759422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:04,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:04,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:04,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084389885] [2025-03-03 15:49:04,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:04,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:04,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:04,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:04,206 INFO L87 Difference]: Start difference. First operand 2718 states and 4874 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:04,516 INFO L93 Difference]: Finished difference Result 3353 states and 5869 transitions. [2025-03-03 15:49:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:04,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:04,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:04,528 INFO L225 Difference]: With dead ends: 3353 [2025-03-03 15:49:04,528 INFO L226 Difference]: Without dead ends: 2772 [2025-03-03 15:49:04,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:04,533 INFO L435 NwaCegarLoop]: 4310 mSDtfsCounter, 4566 mSDsluCounter, 8501 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 12811 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:04,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 12811 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:49:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2025-03-03 15:49:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2718. [2025-03-03 15:49:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2662 states have (on average 1.7997746055597295) internal successors, (4791), 2666 states have internal predecessors, (4791), 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-03 15:49:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 4872 transitions. [2025-03-03 15:49:04,595 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 4872 transitions. Word has length 135 [2025-03-03 15:49:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:04,595 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 4872 transitions. [2025-03-03 15:49:04,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 4872 transitions. [2025-03-03 15:49:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:04,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:04,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:04,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:49:04,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:04,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash -93288215, now seen corresponding path program 1 times [2025-03-03 15:49:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:04,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49546477] [2025-03-03 15:49:04,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:04,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:04,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:04,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:04,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49546477] [2025-03-03 15:49:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49546477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:04,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:04,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270774611] [2025-03-03 15:49:04,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:04,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:04,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:04,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:04,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:04,772 INFO L87 Difference]: Start difference. First operand 2718 states and 4872 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:05,424 INFO L93 Difference]: Finished difference Result 3665 states and 6344 transitions. [2025-03-03 15:49:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:05,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:05,436 INFO L225 Difference]: With dead ends: 3665 [2025-03-03 15:49:05,436 INFO L226 Difference]: Without dead ends: 3084 [2025-03-03 15:49:05,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:05,439 INFO L435 NwaCegarLoop]: 4570 mSDtfsCounter, 4794 mSDsluCounter, 13748 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4810 SdHoareTripleChecker+Valid, 18318 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:05,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4810 Valid, 18318 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:49:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2025-03-03 15:49:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2993. [2025-03-03 15:49:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2913 states have (on average 1.7748026089941642) internal successors, (5170), 2918 states have internal predecessors, (5170), 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-03 15:49:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 5288 transitions. [2025-03-03 15:49:05,508 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 5288 transitions. Word has length 135 [2025-03-03 15:49:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:05,508 INFO L471 AbstractCegarLoop]: Abstraction has 2993 states and 5288 transitions. [2025-03-03 15:49:05,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 5288 transitions. [2025-03-03 15:49:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:05,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:05,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:05,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:49:05,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:05,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1239828728, now seen corresponding path program 1 times [2025-03-03 15:49:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132718504] [2025-03-03 15:49:05,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:05,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:05,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:05,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:05,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:05,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:05,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132718504] [2025-03-03 15:49:05,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132718504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:05,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:05,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017483712] [2025-03-03 15:49:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:05,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:05,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:05,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:05,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:05,675 INFO L87 Difference]: Start difference. First operand 2993 states and 5288 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:06,296 INFO L93 Difference]: Finished difference Result 4533 states and 7677 transitions. [2025-03-03 15:49:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:06,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:06,310 INFO L225 Difference]: With dead ends: 4533 [2025-03-03 15:49:06,310 INFO L226 Difference]: Without dead ends: 3677 [2025-03-03 15:49:06,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:06,314 INFO L435 NwaCegarLoop]: 4566 mSDtfsCounter, 4789 mSDsluCounter, 13736 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4805 SdHoareTripleChecker+Valid, 18302 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:06,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4805 Valid, 18302 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:49:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2025-03-03 15:49:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3574. [2025-03-03 15:49:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3574 states, 3444 states have (on average 1.7372241579558654) internal successors, (5983), 3453 states have internal predecessors, (5983), 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-03 15:49:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 6181 transitions. [2025-03-03 15:49:06,405 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 6181 transitions. Word has length 135 [2025-03-03 15:49:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:06,405 INFO L471 AbstractCegarLoop]: Abstraction has 3574 states and 6181 transitions. [2025-03-03 15:49:06,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 6181 transitions. [2025-03-03 15:49:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:06,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:06,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:06,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:49:06,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:06,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1771227401, now seen corresponding path program 1 times [2025-03-03 15:49:06,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:06,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682873203] [2025-03-03 15:49:06,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:06,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:06,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:06,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:06,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:06,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:06,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682873203] [2025-03-03 15:49:06,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682873203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:06,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:06,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:06,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689107552] [2025-03-03 15:49:06,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:06,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:06,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:06,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:06,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:06,526 INFO L87 Difference]: Start difference. First operand 3574 states and 6181 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:07,074 INFO L93 Difference]: Finished difference Result 6388 states and 10584 transitions. [2025-03-03 15:49:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:07,098 INFO L225 Difference]: With dead ends: 6388 [2025-03-03 15:49:07,098 INFO L226 Difference]: Without dead ends: 4951 [2025-03-03 15:49:07,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:07,106 INFO L435 NwaCegarLoop]: 4342 mSDtfsCounter, 4811 mSDsluCounter, 13193 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4827 SdHoareTripleChecker+Valid, 17535 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:07,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4827 Valid, 17535 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:49:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2025-03-03 15:49:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4823. [2025-03-03 15:49:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 4587 states have (on average 1.6923915413124047) internal successors, (7763), 4610 states have internal predecessors, (7763), 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-03 15:49:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 8145 transitions. [2025-03-03 15:49:07,282 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 8145 transitions. Word has length 135 [2025-03-03 15:49:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:07,282 INFO L471 AbstractCegarLoop]: Abstraction has 4823 states and 8145 transitions. [2025-03-03 15:49:07,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 8145 transitions. [2025-03-03 15:49:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:07,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:07,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:07,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:49:07,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:07,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2006905576, now seen corresponding path program 1 times [2025-03-03 15:49:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:07,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55500872] [2025-03-03 15:49:07,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:07,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:07,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:07,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:07,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:07,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55500872] [2025-03-03 15:49:07,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55500872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:07,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201594827] [2025-03-03 15:49:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:07,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:07,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:07,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:07,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:07,515 INFO L87 Difference]: Start difference. First operand 4823 states and 8145 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:08,360 INFO L93 Difference]: Finished difference Result 10427 states and 17098 transitions. [2025-03-03 15:49:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:08,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:08,392 INFO L225 Difference]: With dead ends: 10427 [2025-03-03 15:49:08,393 INFO L226 Difference]: Without dead ends: 7741 [2025-03-03 15:49:08,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:08,404 INFO L435 NwaCegarLoop]: 4560 mSDtfsCounter, 4779 mSDsluCounter, 13718 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4795 SdHoareTripleChecker+Valid, 18278 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:08,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4795 Valid, 18278 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:49:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2025-03-03 15:49:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 7564. [2025-03-03 15:49:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7564 states, 7098 states have (on average 1.6555367709213864) internal successors, (11751), 7167 states have internal predecessors, (11751), 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-03 15:49:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 12597 transitions. [2025-03-03 15:49:08,588 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 12597 transitions. Word has length 135 [2025-03-03 15:49:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:08,589 INFO L471 AbstractCegarLoop]: Abstraction has 7564 states and 12597 transitions. [2025-03-03 15:49:08,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 12597 transitions. [2025-03-03 15:49:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:08,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:08,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:08,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:49:08,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:08,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1183224105, now seen corresponding path program 1 times [2025-03-03 15:49:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:08,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959236331] [2025-03-03 15:49:08,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:08,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:08,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:08,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:08,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959236331] [2025-03-03 15:49:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959236331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986571546] [2025-03-03 15:49:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:08,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:08,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:08,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:08,706 INFO L87 Difference]: Start difference. First operand 7564 states and 12597 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:09,521 INFO L93 Difference]: Finished difference Result 19418 states and 32204 transitions. [2025-03-03 15:49:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:09,571 INFO L225 Difference]: With dead ends: 19418 [2025-03-03 15:49:09,571 INFO L226 Difference]: Without dead ends: 13991 [2025-03-03 15:49:09,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:09,586 INFO L435 NwaCegarLoop]: 4557 mSDtfsCounter, 4774 mSDsluCounter, 13709 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 18266 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:09,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 18266 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:49:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13991 states. [2025-03-03 15:49:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13991 to 13721. [2025-03-03 15:49:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13721 states, 12741 states have (on average 1.6409230044737462) internal successors, (20907), 12956 states have internal predecessors, (20907), 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-03 15:49:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 23065 transitions. [2025-03-03 15:49:09,946 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 23065 transitions. Word has length 135 [2025-03-03 15:49:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:09,947 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 23065 transitions. [2025-03-03 15:49:09,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 23065 transitions. [2025-03-03 15:49:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:09,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:09,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:09,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:49:09,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:09,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2029934904, now seen corresponding path program 1 times [2025-03-03 15:49:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:09,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459152175] [2025-03-03 15:49:09,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:09,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:09,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:09,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:09,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:10,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459152175] [2025-03-03 15:49:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459152175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:10,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:10,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477935087] [2025-03-03 15:49:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:10,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:10,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:10,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:10,042 INFO L87 Difference]: Start difference. First operand 13721 states and 23065 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:10,636 INFO L93 Difference]: Finished difference Result 28245 states and 48382 transitions. [2025-03-03 15:49:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:10,690 INFO L225 Difference]: With dead ends: 28245 [2025-03-03 15:49:10,690 INFO L226 Difference]: Without dead ends: 16661 [2025-03-03 15:49:10,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:10,715 INFO L435 NwaCegarLoop]: 4297 mSDtfsCounter, 4558 mSDsluCounter, 8476 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 12773 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:10,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 12773 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:49:10,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16661 states. [2025-03-03 15:49:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16661 to 13721. [2025-03-03 15:49:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13721 states, 12741 states have (on average 1.6383329408994585) internal successors, (20874), 12956 states have internal predecessors, (20874), 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-03 15:49:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 23032 transitions. [2025-03-03 15:49:11,166 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 23032 transitions. Word has length 135 [2025-03-03 15:49:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:11,167 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 23032 transitions. [2025-03-03 15:49:11,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 23032 transitions. [2025-03-03 15:49:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:11,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:11,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:11,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:49:11,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:11,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1745740105, now seen corresponding path program 1 times [2025-03-03 15:49:11,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:11,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789105147] [2025-03-03 15:49:11,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:11,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:11,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:11,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:11,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789105147] [2025-03-03 15:49:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789105147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:11,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877517045] [2025-03-03 15:49:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:11,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:11,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:11,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:11,270 INFO L87 Difference]: Start difference. First operand 13721 states and 23032 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:11,835 INFO L93 Difference]: Finished difference Result 28000 states and 47826 transitions. [2025-03-03 15:49:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:11,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:11,893 INFO L225 Difference]: With dead ends: 28000 [2025-03-03 15:49:11,893 INFO L226 Difference]: Without dead ends: 16416 [2025-03-03 15:49:11,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:11,920 INFO L435 NwaCegarLoop]: 4294 mSDtfsCounter, 4555 mSDsluCounter, 8471 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4571 SdHoareTripleChecker+Valid, 12765 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:11,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4571 Valid, 12765 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:49:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2025-03-03 15:49:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 13721. [2025-03-03 15:49:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13721 states, 12741 states have (on average 1.6357428773251708) internal successors, (20841), 12956 states have internal predecessors, (20841), 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-03 15:49:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 22999 transitions. [2025-03-03 15:49:12,446 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 22999 transitions. Word has length 135 [2025-03-03 15:49:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:12,447 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 22999 transitions. [2025-03-03 15:49:12,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 22999 transitions. [2025-03-03 15:49:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:12,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:12,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:12,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:49:12,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:12,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 759157416, now seen corresponding path program 1 times [2025-03-03 15:49:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367897338] [2025-03-03 15:49:12,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:12,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:12,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:12,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:12,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:12,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367897338] [2025-03-03 15:49:12,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367897338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:12,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:12,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391182681] [2025-03-03 15:49:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:12,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:12,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:12,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:12,592 INFO L87 Difference]: Start difference. First operand 13721 states and 22999 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:13,894 INFO L93 Difference]: Finished difference Result 41321 states and 70381 transitions. [2025-03-03 15:49:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:13,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:14,000 INFO L225 Difference]: With dead ends: 41321 [2025-03-03 15:49:14,000 INFO L226 Difference]: Without dead ends: 29737 [2025-03-03 15:49:14,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:14,037 INFO L435 NwaCegarLoop]: 4542 mSDtfsCounter, 5007 mSDsluCounter, 13661 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5032 SdHoareTripleChecker+Valid, 18203 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:14,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5032 Valid, 18203 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:49:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29737 states. [2025-03-03 15:49:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29737 to 27316. [2025-03-03 15:49:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27316 states, 25178 states have (on average 1.6394074191754706) internal successors, (41277), 25847 states have internal predecessors, (41277), 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-03 15:49:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27316 states to 27316 states and 47531 transitions. [2025-03-03 15:49:14,890 INFO L78 Accepts]: Start accepts. Automaton has 27316 states and 47531 transitions. Word has length 135 [2025-03-03 15:49:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:14,890 INFO L471 AbstractCegarLoop]: Abstraction has 27316 states and 47531 transitions. [2025-03-03 15:49:14,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27316 states and 47531 transitions. [2025-03-03 15:49:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:14,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:14,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:14,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:49:14,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:14,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1835710825, now seen corresponding path program 1 times [2025-03-03 15:49:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984591686] [2025-03-03 15:49:14,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:14,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:14,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:14,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:14,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:14,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984591686] [2025-03-03 15:49:14,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984591686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:14,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:14,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405900812] [2025-03-03 15:49:14,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:14,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:14,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:14,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:14,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:14,992 INFO L87 Difference]: Start difference. First operand 27316 states and 47531 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:16,005 INFO L93 Difference]: Finished difference Result 59074 states and 106270 transitions. [2025-03-03 15:49:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:16,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:16,129 INFO L225 Difference]: With dead ends: 59074 [2025-03-03 15:49:16,129 INFO L226 Difference]: Without dead ends: 33895 [2025-03-03 15:49:16,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:16,195 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4549 mSDsluCounter, 8460 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4565 SdHoareTripleChecker+Valid, 12749 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:16,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4565 Valid, 12749 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:49:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33895 states. [2025-03-03 15:49:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33895 to 27316. [2025-03-03 15:49:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27316 states, 25178 states have (on average 1.6368258003018508) internal successors, (41212), 25847 states have internal predecessors, (41212), 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-03 15:49:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27316 states to 27316 states and 47466 transitions. [2025-03-03 15:49:17,443 INFO L78 Accepts]: Start accepts. Automaton has 27316 states and 47466 transitions. Word has length 135 [2025-03-03 15:49:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:17,444 INFO L471 AbstractCegarLoop]: Abstraction has 27316 states and 47466 transitions. [2025-03-03 15:49:17,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 27316 states and 47466 transitions. [2025-03-03 15:49:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:17,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:17,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:17,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:49:17,456 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:17,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash -623413624, now seen corresponding path program 1 times [2025-03-03 15:49:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549343592] [2025-03-03 15:49:17,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:17,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:17,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:17,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:17,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:17,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:17,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549343592] [2025-03-03 15:49:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549343592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:17,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:17,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:49:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527289374] [2025-03-03 15:49:17,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:17,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:49:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:17,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:49:17,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:17,578 INFO L87 Difference]: Start difference. First operand 27316 states and 47466 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:20,056 INFO L93 Difference]: Finished difference Result 86750 states and 157276 transitions. [2025-03-03 15:49:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:49:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:20,343 INFO L225 Difference]: With dead ends: 86750 [2025-03-03 15:49:20,344 INFO L226 Difference]: Without dead ends: 61571 [2025-03-03 15:49:20,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:49:20,667 INFO L435 NwaCegarLoop]: 4534 mSDtfsCounter, 4934 mSDsluCounter, 13638 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4959 SdHoareTripleChecker+Valid, 18172 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:20,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4959 Valid, 18172 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:49:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61571 states. [2025-03-03 15:49:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61571 to 57812. [2025-03-03 15:49:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57812 states, 52904 states have (on average 1.6495917132920006) internal successors, (87270), 54967 states have internal predecessors, (87270), 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-03 15:49:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57812 states to 57812 states and 107796 transitions. [2025-03-03 15:49:23,379 INFO L78 Accepts]: Start accepts. Automaton has 57812 states and 107796 transitions. Word has length 135 [2025-03-03 15:49:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:23,379 INFO L471 AbstractCegarLoop]: Abstraction has 57812 states and 107796 transitions. [2025-03-03 15:49:23,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57812 states and 107796 transitions. [2025-03-03 15:49:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:23,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:23,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:23,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:49:23,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:23,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -564192887, now seen corresponding path program 1 times [2025-03-03 15:49:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196488373] [2025-03-03 15:49:23,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:23,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:23,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:23,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:23,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:23,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:23,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196488373] [2025-03-03 15:49:23,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196488373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:23,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:23,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:23,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150650671] [2025-03-03 15:49:23,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:23,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:23,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:23,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:23,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:23,494 INFO L87 Difference]: Start difference. First operand 57812 states and 107796 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:49:26,574 INFO L93 Difference]: Finished difference Result 128810 states and 252330 transitions. [2025-03-03 15:49:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:49:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 15:49:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:49:27,039 INFO L225 Difference]: With dead ends: 128810 [2025-03-03 15:49:27,039 INFO L226 Difference]: Without dead ends: 73135 [2025-03-03 15:49:27,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:49:27,142 INFO L435 NwaCegarLoop]: 4271 mSDtfsCounter, 4556 mSDsluCounter, 8438 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4572 SdHoareTripleChecker+Valid, 12709 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:49:27,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4572 Valid, 12709 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:49:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73135 states. [2025-03-03 15:49:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73135 to 57812. [2025-03-03 15:49:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57812 states, 52904 states have (on average 1.6471533343414486) internal successors, (87141), 54967 states have internal predecessors, (87141), 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-03 15:49:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57812 states to 57812 states and 107667 transitions. [2025-03-03 15:49:31,702 INFO L78 Accepts]: Start accepts. Automaton has 57812 states and 107667 transitions. Word has length 135 [2025-03-03 15:49:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:49:31,703 INFO L471 AbstractCegarLoop]: Abstraction has 57812 states and 107667 transitions. [2025-03-03 15:49:31,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-03 15:49:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 57812 states and 107667 transitions. [2025-03-03 15:49:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 15:49:31,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:49:31,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:49:31,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:49:31,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:49:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:49:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash 130454120, now seen corresponding path program 1 times [2025-03-03 15:49:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:49:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983384025] [2025-03-03 15:49:31,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:49:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:49:31,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 15:49:31,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 15:49:31,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:49:31,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:49:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:49:31,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:49:31,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983384025] [2025-03-03 15:49:31,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983384025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:49:31,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:49:31,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:49:31,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449157172] [2025-03-03 15:49:31,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:49:31,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:49:31,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:49:31,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:49:31,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:49:31,788 INFO L87 Difference]: Start difference. First operand 57812 states and 107667 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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)