./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e70b00a4f3ead30bf9fe88f8130a3c8de29ffa3a9165185f8db2f923a85de85c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:49:20,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:49:20,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:49:20,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:49:20,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:49:20,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:49:20,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:49:20,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:49:20,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:49:20,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:49:20,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:49:20,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:49:20,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:49:20,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:49:20,374 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:49:20,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:49:20,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:49:20,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:49:20,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:49:20,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:49:20,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:49:20,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:49:20,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:49:20,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:49:20,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:49:20,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:49:20,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:49:20,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:49:20,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:49:20,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:49:20,378 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 -> e70b00a4f3ead30bf9fe88f8130a3c8de29ffa3a9165185f8db2f923a85de85c [2025-03-08 06:49:20,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:49:20,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:49:20,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:49:20,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:49:20,620 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:49:20,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.c [2025-03-08 06:49:21,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875edc8a2/e73b68a67f414a9b952932c99098a361/FLAG3272cf0ce [2025-03-08 06:49:22,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:49:22,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.c [2025-03-08 06:49:22,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875edc8a2/e73b68a67f414a9b952932c99098a361/FLAG3272cf0ce [2025-03-08 06:49:22,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875edc8a2/e73b68a67f414a9b952932c99098a361 [2025-03-08 06:49:22,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:49:22,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:49:22,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:49:22,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:49:22,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:49:22,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:49:22" (1/1) ... [2025-03-08 06:49:22,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:22, skipping insertion in model container [2025-03-08 06:49:22,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:49:22" (1/1) ... [2025-03-08 06:49:22,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:49:23,890 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_label42+token_ring.07.cil-1.c[378560,378573] [2025-03-08 06:49:23,919 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_label42+token_ring.07.cil-1.c[383339,383352] [2025-03-08 06:49:24,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:49:24,127 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:49:24,629 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_label42+token_ring.07.cil-1.c[378560,378573] [2025-03-08 06:49:24,635 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_label42+token_ring.07.cil-1.c[383339,383352] [2025-03-08 06:49:24,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:49:24,739 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:49:24,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24 WrapperNode [2025-03-08 06:49:24,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:49:24,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:49:24,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:49:24,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:49:24,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:24,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,122 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-03-08 06:49:25,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:49:25,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:49:25,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:49:25,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:49:25,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,273 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:49:25,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:49:25,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:49:25,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:49:25,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:49:25,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (1/1) ... [2025-03-08 06:49:25,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:49:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:49:25,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:49:25,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:49:25,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:49:25,558 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:49:25,558 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:49:25,558 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:49:25,558 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:49:25,558 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:49:25,558 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:49:25,558 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:49:25,558 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:49:25,559 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:49:25,559 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:49:25,559 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:49:25,559 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:49:25,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:49:25,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:49:25,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:49:25,673 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:49:25,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:49:31,772 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:49:31,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:49:31,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:49:31,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:49:31,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:49:31,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:49:31,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:49:31,972 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2025-03-08 06:49:31,973 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:49:32,031 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:49:32,031 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:49:32,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:49:32 BoogieIcfgContainer [2025-03-08 06:49:32,032 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:49:32,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:49:32,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:49:32,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:49:32,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:49:22" (1/3) ... [2025-03-08 06:49:32,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427d7225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:49:32, skipping insertion in model container [2025-03-08 06:49:32,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:24" (2/3) ... [2025-03-08 06:49:32,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427d7225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:49:32, skipping insertion in model container [2025-03-08 06:49:32,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:49:32" (3/3) ... [2025-03-08 06:49:32,039 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.07.cil-1.c [2025-03-08 06:49:32,051 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:49:32,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.07.cil-1.c that has 7 procedures, 2438 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-08 06:49:32,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:49:32,155 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;@6a7252b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:49:32,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:49:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 06:49:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:32,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:32,178 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] [2025-03-08 06:49:32,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:32,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash 140385463, now seen corresponding path program 1 times [2025-03-08 06:49:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097240464] [2025-03-08 06:49:32,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:32,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:32,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:32,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:32,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:32,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097240464] [2025-03-08 06:49:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097240464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:32,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:32,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:49:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081639011] [2025-03-08 06:49:32,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:32,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:49:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:32,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:49:32,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:49:32,698 INFO L87 Difference]: Start difference. First operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:33,156 INFO L93 Difference]: Finished difference Result 4875 states and 8979 transitions. [2025-03-08 06:49:33,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:49:33,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:33,187 INFO L225 Difference]: With dead ends: 4875 [2025-03-08 06:49:33,187 INFO L226 Difference]: Without dead ends: 2387 [2025-03-08 06:49:33,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:33,201 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4541 mSDsluCounter, 8523 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4556 SdHoareTripleChecker+Valid, 12837 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:33,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4556 Valid, 12837 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:49:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2025-03-08 06:49:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2371. [2025-03-08 06:49:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2342 states have (on average 1.8373185311699403) internal successors, (4303), 2344 states have internal predecessors, (4303), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 06:49:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 4345 transitions. [2025-03-08 06:49:33,322 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 4345 transitions. Word has length 121 [2025-03-08 06:49:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:33,323 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 4345 transitions. [2025-03-08 06:49:33,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 4345 transitions. [2025-03-08 06:49:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:33,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:33,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:49:33,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:49:33,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:33,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -792968874, now seen corresponding path program 1 times [2025-03-08 06:49:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16179634] [2025-03-08 06:49:33,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:33,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:33,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:33,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:33,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:33,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:33,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16179634] [2025-03-08 06:49:33,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16179634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:33,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:33,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:49:33,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032097050] [2025-03-08 06:49:33,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:33,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:49:33,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:33,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:49:33,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:33,593 INFO L87 Difference]: Start difference. First operand 2371 states and 4345 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:34,188 INFO L93 Difference]: Finished difference Result 2885 states and 5161 transitions. [2025-03-08 06:49:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:49:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:34,203 INFO L225 Difference]: With dead ends: 2885 [2025-03-08 06:49:34,204 INFO L226 Difference]: Without dead ends: 2650 [2025-03-08 06:49:34,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:49:34,207 INFO L435 NwaCegarLoop]: 4455 mSDtfsCounter, 4674 mSDsluCounter, 13459 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4689 SdHoareTripleChecker+Valid, 17914 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:34,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4689 Valid, 17914 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:49:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2025-03-08 06:49:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2618. [2025-03-08 06:49:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2563 states have (on average 1.81467030823254) internal successors, (4651), 2567 states have internal predecessors, (4651), 39 states have call successors, (39), 12 states have call predecessors, (39), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-03-08 06:49:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 4736 transitions. [2025-03-08 06:49:34,291 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 4736 transitions. Word has length 121 [2025-03-08 06:49:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:34,292 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 4736 transitions. [2025-03-08 06:49:34,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 4736 transitions. [2025-03-08 06:49:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:34,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:34,296 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] [2025-03-08 06:49:34,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:49:34,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:34,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash 700943575, now seen corresponding path program 1 times [2025-03-08 06:49:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:34,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643962625] [2025-03-08 06:49:34,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:34,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:34,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:34,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:34,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:34,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643962625] [2025-03-08 06:49:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643962625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:34,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:34,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:49:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565534160] [2025-03-08 06:49:34,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:34,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:49:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:34,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:49:34,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:34,453 INFO L87 Difference]: Start difference. First operand 2618 states and 4736 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:34,977 INFO L93 Difference]: Finished difference Result 3622 states and 6329 transitions. [2025-03-08 06:49:34,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:49:34,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:34,989 INFO L225 Difference]: With dead ends: 3622 [2025-03-08 06:49:34,989 INFO L226 Difference]: Without dead ends: 3142 [2025-03-08 06:49:34,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:49:34,992 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 4670 mSDsluCounter, 13388 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 17809 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:34,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 17809 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:49:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2025-03-08 06:49:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3098. [2025-03-08 06:49:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2995 states have (on average 1.778964941569282) internal successors, (5328), 3003 states have internal predecessors, (5328), 71 states have call successors, (71), 24 states have call predecessors, (71), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-03-08 06:49:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 5493 transitions. [2025-03-08 06:49:35,085 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 5493 transitions. Word has length 121 [2025-03-08 06:49:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:35,085 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 5493 transitions. [2025-03-08 06:49:35,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 5493 transitions. [2025-03-08 06:49:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:35,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:35,088 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] [2025-03-08 06:49:35,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:49:35,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:35,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -497791690, now seen corresponding path program 1 times [2025-03-08 06:49:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:35,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430846116] [2025-03-08 06:49:35,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:35,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:35,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:35,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:35,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:35,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:35,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430846116] [2025-03-08 06:49:35,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430846116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:35,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:35,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:49:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075020318] [2025-03-08 06:49:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:35,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:49:35,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:35,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:49:35,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:35,252 INFO L87 Difference]: Start difference. First operand 3098 states and 5493 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:35,886 INFO L93 Difference]: Finished difference Result 5159 states and 8800 transitions. [2025-03-08 06:49:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:49:35,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:35,907 INFO L225 Difference]: With dead ends: 5159 [2025-03-08 06:49:35,907 INFO L226 Difference]: Without dead ends: 4199 [2025-03-08 06:49:35,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:49:35,913 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 4665 mSDsluCounter, 13376 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4680 SdHoareTripleChecker+Valid, 17795 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:35,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4680 Valid, 17795 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:49:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2025-03-08 06:49:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 4132. [2025-03-08 06:49:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 3927 states have (on average 1.73414820473644) internal successors, (6810), 3949 states have internal predecessors, (6810), 135 states have call successors, (135), 48 states have call predecessors, (135), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-03-08 06:49:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 7159 transitions. [2025-03-08 06:49:36,070 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 7159 transitions. Word has length 121 [2025-03-08 06:49:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:36,070 INFO L471 AbstractCegarLoop]: Abstraction has 4132 states and 7159 transitions. [2025-03-08 06:49:36,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 7159 transitions. [2025-03-08 06:49:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:36,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:36,073 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] [2025-03-08 06:49:36,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:49:36,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:36,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash 17728759, now seen corresponding path program 1 times [2025-03-08 06:49:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:36,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835260856] [2025-03-08 06:49:36,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:36,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:36,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:36,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:36,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835260856] [2025-03-08 06:49:36,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835260856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:36,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:36,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:49:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820249670] [2025-03-08 06:49:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:36,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:49:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:36,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:49:36,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:36,219 INFO L87 Difference]: Start difference. First operand 4132 states and 7159 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:36,844 INFO L93 Difference]: Finished difference Result 8510 states and 14338 transitions. [2025-03-08 06:49:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:49:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:36,877 INFO L225 Difference]: With dead ends: 8510 [2025-03-08 06:49:36,877 INFO L226 Difference]: Without dead ends: 6516 [2025-03-08 06:49:36,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:49:36,888 INFO L435 NwaCegarLoop]: 4415 mSDtfsCounter, 4660 mSDsluCounter, 13359 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4675 SdHoareTripleChecker+Valid, 17774 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:36,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4675 Valid, 17774 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:49:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2025-03-08 06:49:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6406. [2025-03-08 06:49:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 5979 states have (on average 1.6939287506271952) internal successors, (10128), 6047 states have internal predecessors, (10128), 263 states have call successors, (263), 96 states have call predecessors, (263), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-03-08 06:49:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 10941 transitions. [2025-03-08 06:49:37,100 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 10941 transitions. Word has length 121 [2025-03-08 06:49:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:37,101 INFO L471 AbstractCegarLoop]: Abstraction has 6406 states and 10941 transitions. [2025-03-08 06:49:37,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 10941 transitions. [2025-03-08 06:49:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:37,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:37,106 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] [2025-03-08 06:49:37,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:49:37,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:37,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash -935472874, now seen corresponding path program 1 times [2025-03-08 06:49:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:37,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101478375] [2025-03-08 06:49:37,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:37,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:37,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:37,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:37,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:37,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:37,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101478375] [2025-03-08 06:49:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101478375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:37,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:49:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148667116] [2025-03-08 06:49:37,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:37,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:49:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:37,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:49:37,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:37,255 INFO L87 Difference]: Start difference. First operand 6406 states and 10941 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:38,065 INFO L93 Difference]: Finished difference Result 15977 states and 27196 transitions. [2025-03-08 06:49:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:49:38,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:38,126 INFO L225 Difference]: With dead ends: 15977 [2025-03-08 06:49:38,127 INFO L226 Difference]: Without dead ends: 11709 [2025-03-08 06:49:38,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:49:38,149 INFO L435 NwaCegarLoop]: 4413 mSDtfsCounter, 4655 mSDsluCounter, 13347 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 17760 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:38,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 17760 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:49:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11709 states. [2025-03-08 06:49:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11709 to 11520. [2025-03-08 06:49:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.673053327041057) internal successors, (17726), 10809 states have internal predecessors, (17726), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:49:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19851 transitions. [2025-03-08 06:49:38,577 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19851 transitions. Word has length 121 [2025-03-08 06:49:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:38,578 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19851 transitions. [2025-03-08 06:49:38,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19851 transitions. [2025-03-08 06:49:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:38,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:38,587 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] [2025-03-08 06:49:38,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:49:38,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:38,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:38,588 INFO L85 PathProgramCache]: Analyzing trace with hash -134937321, now seen corresponding path program 1 times [2025-03-08 06:49:38,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:38,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798195096] [2025-03-08 06:49:38,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:38,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:38,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:38,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:38,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:38,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798195096] [2025-03-08 06:49:38,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798195096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:38,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:38,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:49:38,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993513404] [2025-03-08 06:49:38,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:38,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:49:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:38,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:49:38,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:49:38,684 INFO L87 Difference]: Start difference. First operand 11520 states and 19851 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:39,202 INFO L93 Difference]: Finished difference Result 23334 states and 41003 transitions. [2025-03-08 06:49:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:49:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:39,254 INFO L225 Difference]: With dead ends: 23334 [2025-03-08 06:49:39,254 INFO L226 Difference]: Without dead ends: 13950 [2025-03-08 06:49:39,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:39,289 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 4466 mSDsluCounter, 8364 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 12598 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:39,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 12598 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:49:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13950 states. [2025-03-08 06:49:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13950 to 11520. [2025-03-08 06:49:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.6699386503067484) internal successors, (17693), 10809 states have internal predecessors, (17693), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:49:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19818 transitions. [2025-03-08 06:49:39,724 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19818 transitions. Word has length 121 [2025-03-08 06:49:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:39,725 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19818 transitions. [2025-03-08 06:49:39,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19818 transitions. [2025-03-08 06:49:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:39,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:39,734 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] [2025-03-08 06:49:39,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:49:39,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:39,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash -663302922, now seen corresponding path program 1 times [2025-03-08 06:49:39,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:39,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9021535] [2025-03-08 06:49:39,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:39,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:39,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:39,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:39,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:39,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:39,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9021535] [2025-03-08 06:49:39,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9021535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:39,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:39,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:49:39,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475126240] [2025-03-08 06:49:39,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:39,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:49:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:39,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:49:39,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:49:39,888 INFO L87 Difference]: Start difference. First operand 11520 states and 19818 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:40,342 INFO L93 Difference]: Finished difference Result 22848 states and 39965 transitions. [2025-03-08 06:49:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:49:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:40,392 INFO L225 Difference]: With dead ends: 22848 [2025-03-08 06:49:40,392 INFO L226 Difference]: Without dead ends: 13464 [2025-03-08 06:49:40,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:40,424 INFO L435 NwaCegarLoop]: 4229 mSDtfsCounter, 4460 mSDsluCounter, 8353 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 12582 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:40,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 12582 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:49:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13464 states. [2025-03-08 06:49:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13464 to 11520. [2025-03-08 06:49:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.6668239735724397) internal successors, (17660), 10809 states have internal predecessors, (17660), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:49:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19785 transitions. [2025-03-08 06:49:40,997 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19785 transitions. Word has length 121 [2025-03-08 06:49:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:40,999 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19785 transitions. [2025-03-08 06:49:40,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19785 transitions. [2025-03-08 06:49:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:41,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:41,005 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] [2025-03-08 06:49:41,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:49:41,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:41,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1472790379, now seen corresponding path program 1 times [2025-03-08 06:49:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189275131] [2025-03-08 06:49:41,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:41,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:41,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:41,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:41,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:41,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189275131] [2025-03-08 06:49:41,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189275131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:41,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:41,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:49:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140477584] [2025-03-08 06:49:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:41,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:49:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:41,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:49:41,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:41,127 INFO L87 Difference]: Start difference. First operand 11520 states and 19785 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:42,195 INFO L93 Difference]: Finished difference Result 33455 states and 58477 transitions. [2025-03-08 06:49:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:49:42,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:42,269 INFO L225 Difference]: With dead ends: 33455 [2025-03-08 06:49:42,269 INFO L226 Difference]: Without dead ends: 24073 [2025-03-08 06:49:42,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:49:42,291 INFO L435 NwaCegarLoop]: 4398 mSDtfsCounter, 4796 mSDsluCounter, 13279 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4819 SdHoareTripleChecker+Valid, 17677 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:42,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4819 Valid, 17677 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:49:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24073 states. [2025-03-08 06:49:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24073 to 22464. [2025-03-08 06:49:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.658256993092637) internal successors, (33850), 21081 states have internal predecessors, (33850), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:49:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 40071 transitions. [2025-03-08 06:49:43,186 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 40071 transitions. Word has length 121 [2025-03-08 06:49:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:43,187 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 40071 transitions. [2025-03-08 06:49:43,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 40071 transitions. [2025-03-08 06:49:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:43,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:43,198 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] [2025-03-08 06:49:43,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:49:43,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:43,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1914544874, now seen corresponding path program 1 times [2025-03-08 06:49:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:43,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622900917] [2025-03-08 06:49:43,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:43,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:43,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:43,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:43,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622900917] [2025-03-08 06:49:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622900917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:43,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:49:43,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537104677] [2025-03-08 06:49:43,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:43,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:49:43,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:43,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:49:43,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:49:43,292 INFO L87 Difference]: Start difference. First operand 22464 states and 40071 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:44,223 INFO L93 Difference]: Finished difference Result 47166 states and 87073 transitions. [2025-03-08 06:49:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:49:44,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:44,324 INFO L225 Difference]: With dead ends: 47166 [2025-03-08 06:49:44,324 INFO L226 Difference]: Without dead ends: 26838 [2025-03-08 06:49:44,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:44,367 INFO L435 NwaCegarLoop]: 4224 mSDtfsCounter, 4456 mSDsluCounter, 8344 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4471 SdHoareTripleChecker+Valid, 12568 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:44,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4471 Valid, 12568 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:49:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26838 states. [2025-03-08 06:49:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26838 to 22464. [2025-03-08 06:49:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.6550727477587812) internal successors, (33785), 21081 states have internal predecessors, (33785), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:49:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 40006 transitions. [2025-03-08 06:49:45,783 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 40006 transitions. Word has length 121 [2025-03-08 06:49:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:45,783 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 40006 transitions. [2025-03-08 06:49:45,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 40006 transitions. [2025-03-08 06:49:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:45,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:45,795 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] [2025-03-08 06:49:45,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:49:45,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:45,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1928795019, now seen corresponding path program 1 times [2025-03-08 06:49:45,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:45,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63987713] [2025-03-08 06:49:45,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:45,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:45,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:45,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:45,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:45,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:45,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:45,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63987713] [2025-03-08 06:49:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63987713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:45,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:45,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:49:45,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310693315] [2025-03-08 06:49:45,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:45,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:49:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:45,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:49:45,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:49:45,891 INFO L87 Difference]: Start difference. First operand 22464 states and 40006 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:47,275 INFO L93 Difference]: Finished difference Result 46437 states and 85485 transitions. [2025-03-08 06:49:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:49:47,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:47,386 INFO L225 Difference]: With dead ends: 46437 [2025-03-08 06:49:47,386 INFO L226 Difference]: Without dead ends: 26109 [2025-03-08 06:49:47,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:47,445 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 4453 mSDsluCounter, 8339 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 12560 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:47,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 12560 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:49:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26109 states. [2025-03-08 06:49:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26109 to 22464. [2025-03-08 06:49:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.6518885024249252) internal successors, (33720), 21081 states have internal predecessors, (33720), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:49:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 39941 transitions. [2025-03-08 06:49:48,790 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 39941 transitions. Word has length 121 [2025-03-08 06:49:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:48,790 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 39941 transitions. [2025-03-08 06:49:48,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 39941 transitions. [2025-03-08 06:49:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:48,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:48,799 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] [2025-03-08 06:49:48,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:49:48,799 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:48,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1395881270, now seen corresponding path program 1 times [2025-03-08 06:49:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752614066] [2025-03-08 06:49:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:48,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:48,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:48,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:48,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:48,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752614066] [2025-03-08 06:49:48,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752614066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:48,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:48,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:49:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086663406] [2025-03-08 06:49:48,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:48,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:49:48,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:48,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:49:48,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:48,886 INFO L87 Difference]: Start difference. First operand 22464 states and 39941 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:50,569 INFO L93 Difference]: Finished difference Result 67462 states and 126143 transitions. [2025-03-08 06:49:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:49:50,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:50,742 INFO L225 Difference]: With dead ends: 67462 [2025-03-08 06:49:50,742 INFO L226 Difference]: Without dead ends: 47136 [2025-03-08 06:49:50,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:49:50,797 INFO L435 NwaCegarLoop]: 4387 mSDtfsCounter, 4685 mSDsluCounter, 13230 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4708 SdHoareTripleChecker+Valid, 17617 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:50,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4708 Valid, 17617 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:49:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47136 states. [2025-03-08 06:49:53,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47136 to 45466. [2025-03-08 06:49:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45466 states, 40709 states have (on average 1.6418482399469405) internal successors, (66838), 42771 states have internal predecessors, (66838), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-08 06:49:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45466 states to 45466 states and 87331 transitions. [2025-03-08 06:49:53,882 INFO L78 Accepts]: Start accepts. Automaton has 45466 states and 87331 transitions. Word has length 121 [2025-03-08 06:49:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:49:53,882 INFO L471 AbstractCegarLoop]: Abstraction has 45466 states and 87331 transitions. [2025-03-08 06:49:53,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 45466 states and 87331 transitions. [2025-03-08 06:49:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:49:53,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:49:53,897 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] [2025-03-08 06:49:53,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:49:53,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:49:53,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:49:53,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1960554411, now seen corresponding path program 1 times [2025-03-08 06:49:53,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:49:53,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079843117] [2025-03-08 06:49:53,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:49:53,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:49:53,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:49:53,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:49:53,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:49:53,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:49:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:49:53,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:49:53,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079843117] [2025-03-08 06:49:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079843117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:49:53,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:49:53,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:49:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31824553] [2025-03-08 06:49:53,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:49:53,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:49:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:49:53,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:49:53,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:49:53,964 INFO L87 Difference]: Start difference. First operand 45466 states and 87331 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:49:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:49:56,394 INFO L93 Difference]: Finished difference Result 95357 states and 194137 transitions. [2025-03-08 06:49:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:49:56,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:49:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:49:56,663 INFO L225 Difference]: With dead ends: 95357 [2025-03-08 06:49:56,664 INFO L226 Difference]: Without dead ends: 52027 [2025-03-08 06:49:56,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:49:56,794 INFO L435 NwaCegarLoop]: 4216 mSDtfsCounter, 4449 mSDsluCounter, 8330 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4464 SdHoareTripleChecker+Valid, 12546 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:49:56,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4464 Valid, 12546 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:49:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2025-03-08 06:50:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 45466. [2025-03-08 06:50:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45466 states, 40709 states have (on average 1.6386794075020266) internal successors, (66709), 42771 states have internal predecessors, (66709), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-08 06:50:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45466 states to 45466 states and 87202 transitions. [2025-03-08 06:50:01,332 INFO L78 Accepts]: Start accepts. Automaton has 45466 states and 87202 transitions. Word has length 121 [2025-03-08 06:50:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:01,332 INFO L471 AbstractCegarLoop]: Abstraction has 45466 states and 87202 transitions. [2025-03-08 06:50:01,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 45466 states and 87202 transitions. [2025-03-08 06:50:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:50:01,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:01,349 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] [2025-03-08 06:50:01,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:50:01,349 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:01,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1949046102, now seen corresponding path program 1 times [2025-03-08 06:50:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:01,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059037924] [2025-03-08 06:50:01,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:01,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:50:01,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:50:01,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:01,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:01,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059037924] [2025-03-08 06:50:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059037924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:01,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197379123] [2025-03-08 06:50:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:01,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:01,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:01,424 INFO L87 Difference]: Start difference. First operand 45466 states and 87202 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:06,132 INFO L93 Difference]: Finished difference Result 137344 states and 290425 transitions. [2025-03-08 06:50:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:06,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:50:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted.