./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5cd7deef4282090ab6b6f93cd9f668fbdecc3b4b6223d600f0bc6a04f939e1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:06:54,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:06:55,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:06:55,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:06:55,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:06:55,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:06:55,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:06:55,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:06:55,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:06:55,057 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:06:55,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:06:55,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:06:55,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:06:55,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:06:55,057 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:06:55,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:06:55,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:06:55,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:06:55,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:06:55,059 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5cd7deef4282090ab6b6f93cd9f668fbdecc3b4b6223d600f0bc6a04f939e1e [2025-02-05 17:06:55,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:06:55,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:06:55,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:06:55,323 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:06:55,324 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:06:55,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c [2025-02-05 17:06:56,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca28c166a/b8e06ef0deaf46769e337801801169a2/FLAG59195f540 [2025-02-05 17:06:57,028 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:06:57,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c [2025-02-05 17:06:57,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca28c166a/b8e06ef0deaf46769e337801801169a2/FLAG59195f540 [2025-02-05 17:06:57,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca28c166a/b8e06ef0deaf46769e337801801169a2 [2025-02-05 17:06:57,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:06:57,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:06:57,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:06:57,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:06:57,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:06:57,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:06:57" (1/1) ... [2025-02-05 17:06:57,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fce6171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:57, skipping insertion in model container [2025-02-05 17:06:57,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:06:57" (1/1) ... [2025-02-05 17:06:57,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:06:58,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c[376251,376264] [2025-02-05 17:06:58,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c[383339,383352] [2025-02-05 17:06:59,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:06:59,053 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:06:59,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c[376251,376264] [2025-02-05 17:06:59,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c[383339,383352] [2025-02-05 17:06:59,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:06:59,679 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:06:59,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59 WrapperNode [2025-02-05 17:06:59,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:06:59,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:06:59,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:06:59,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:06:59,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:06:59,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,110 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13185 [2025-02-05 17:07:00,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:07:00,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:07:00,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:07:00,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:07:00,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:07:00,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:07:00,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:07:00,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:07:00,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:07:00,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (1/1) ... [2025-02-05 17:07:00,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:07:00,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:07:00,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:07:00,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:07:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:07:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:07:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:07:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:07:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:07:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:07:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:07:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:07:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:07:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:07:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:07:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:07:00,683 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:07:00,685 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:07:07,053 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:07:07,054 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:07:07,054 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:07:07,054 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:07:07,054 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:07:07,054 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:07:07,054 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:07:07,341 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2025-02-05 17:07:07,341 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:07:07,395 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:07:07,395 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:07:07,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:07:07 BoogieIcfgContainer [2025-02-05 17:07:07,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:07:07,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:07:07,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:07:07,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:07:07,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:06:57" (1/3) ... [2025-02-05 17:07:07,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b51a585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:07:07, skipping insertion in model container [2025-02-05 17:07:07,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:59" (2/3) ... [2025-02-05 17:07:07,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b51a585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:07:07, skipping insertion in model container [2025-02-05 17:07:07,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:07:07" (3/3) ... [2025-02-05 17:07:07,404 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.12.cil-2.c [2025-02-05 17:07:07,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:07:07,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label41+token_ring.12.cil-2.c that has 7 procedures, 2591 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-02-05 17:07:07,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:07:07,526 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;@720931e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:07:07,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:07:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 2591 states, 2556 states have (on average 1.828247261345853) internal successors, (4673), 2559 states have internal predecessors, (4673), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 17:07:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:07,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:07,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:07,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:07,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1913484464, now seen corresponding path program 1 times [2025-02-05 17:07:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:07,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938530367] [2025-02-05 17:07:07,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:07,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:07,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:07,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:07,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:07,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:08,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:08,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938530367] [2025-02-05 17:07:08,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938530367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:08,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:08,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438102105] [2025-02-05 17:07:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:08,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:08,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:08,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:08,126 INFO L87 Difference]: Start difference. First operand has 2591 states, 2556 states have (on average 1.828247261345853) internal successors, (4673), 2559 states have internal predecessors, (4673), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:08,877 INFO L93 Difference]: Finished difference Result 5596 states and 10117 transitions. [2025-02-05 17:07:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:07:08,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:08,903 INFO L225 Difference]: With dead ends: 5596 [2025-02-05 17:07:08,903 INFO L226 Difference]: Without dead ends: 2955 [2025-02-05 17:07:08,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:08,921 INFO L435 NwaCegarLoop]: 4516 mSDtfsCounter, 5202 mSDsluCounter, 9319 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 13835 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:08,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 13835 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2025-02-05 17:07:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2926. [2025-02-05 17:07:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2864 states have (on average 1.7838687150837989) internal successors, (5109), 2867 states have internal predecessors, (5109), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:07:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5204 transitions. [2025-02-05 17:07:09,138 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5204 transitions. Word has length 178 [2025-02-05 17:07:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:09,140 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 5204 transitions. [2025-02-05 17:07:09,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5204 transitions. [2025-02-05 17:07:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:09,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:09,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:09,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:07:09,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:09,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:09,147 INFO L85 PathProgramCache]: Analyzing trace with hash -203993454, now seen corresponding path program 1 times [2025-02-05 17:07:09,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148212127] [2025-02-05 17:07:09,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:09,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:09,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:09,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:09,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:09,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:09,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148212127] [2025-02-05 17:07:09,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148212127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:09,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:09,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:09,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619397597] [2025-02-05 17:07:09,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:09,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:09,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:09,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:09,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:09,372 INFO L87 Difference]: Start difference. First operand 2926 states and 5204 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:09,726 INFO L93 Difference]: Finished difference Result 3789 states and 6569 transitions. [2025-02-05 17:07:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:09,739 INFO L225 Difference]: With dead ends: 3789 [2025-02-05 17:07:09,739 INFO L226 Difference]: Without dead ends: 3004 [2025-02-05 17:07:09,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:09,743 INFO L435 NwaCegarLoop]: 4435 mSDtfsCounter, 4797 mSDsluCounter, 8715 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4817 SdHoareTripleChecker+Valid, 13150 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:09,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4817 Valid, 13150 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2025-02-05 17:07:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2926. [2025-02-05 17:07:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2864 states have (on average 1.7831703910614525) internal successors, (5107), 2867 states have internal predecessors, (5107), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:07:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5202 transitions. [2025-02-05 17:07:09,813 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5202 transitions. Word has length 178 [2025-02-05 17:07:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:09,814 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 5202 transitions. [2025-02-05 17:07:09,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5202 transitions. [2025-02-05 17:07:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:09,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:09,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:09,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:07:09,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:09,817 INFO L85 PathProgramCache]: Analyzing trace with hash -509627983, now seen corresponding path program 1 times [2025-02-05 17:07:09,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:09,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315349285] [2025-02-05 17:07:09,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:09,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:09,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:09,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315349285] [2025-02-05 17:07:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315349285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:09,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829204078] [2025-02-05 17:07:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:09,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:09,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:09,989 INFO L87 Difference]: Start difference. First operand 2926 states and 5202 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:11,004 INFO L93 Difference]: Finished difference Result 4214 states and 7228 transitions. [2025-02-05 17:07:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:11,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:11,018 INFO L225 Difference]: With dead ends: 4214 [2025-02-05 17:07:11,019 INFO L226 Difference]: Without dead ends: 3429 [2025-02-05 17:07:11,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:11,023 INFO L435 NwaCegarLoop]: 4529 mSDtfsCounter, 5166 mSDsluCounter, 13765 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5186 SdHoareTripleChecker+Valid, 18294 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:11,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5186 Valid, 18294 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:07:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2025-02-05 17:07:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3300. [2025-02-05 17:07:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3210 states have (on average 1.7545171339563863) internal successors, (5632), 3214 states have internal predecessors, (5632), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-02-05 17:07:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5772 transitions. [2025-02-05 17:07:11,118 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5772 transitions. Word has length 178 [2025-02-05 17:07:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:11,119 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5772 transitions. [2025-02-05 17:07:11,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5772 transitions. [2025-02-05 17:07:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:11,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:11,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:11,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:07:11,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1212223822, now seen corresponding path program 1 times [2025-02-05 17:07:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211117742] [2025-02-05 17:07:11,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:11,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:11,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:11,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:11,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:11,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:11,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211117742] [2025-02-05 17:07:11,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211117742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:11,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:11,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:11,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727102952] [2025-02-05 17:07:11,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:11,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:11,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:11,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:11,281 INFO L87 Difference]: Start difference. First operand 3300 states and 5772 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:12,012 INFO L93 Difference]: Finished difference Result 5403 states and 9071 transitions. [2025-02-05 17:07:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:12,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:12,033 INFO L225 Difference]: With dead ends: 5403 [2025-02-05 17:07:12,034 INFO L226 Difference]: Without dead ends: 4244 [2025-02-05 17:07:12,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:12,040 INFO L435 NwaCegarLoop]: 4780 mSDtfsCounter, 5132 mSDsluCounter, 14423 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5152 SdHoareTripleChecker+Valid, 19203 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:12,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5152 Valid, 19203 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2025-02-05 17:07:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 4095. [2025-02-05 17:07:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 3947 states have (on average 1.7149733975171015) internal successors, (6769), 3955 states have internal predecessors, (6769), 110 states have call successors, (110), 30 states have call predecessors, (110), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-02-05 17:07:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 7005 transitions. [2025-02-05 17:07:12,164 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 7005 transitions. Word has length 178 [2025-02-05 17:07:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:12,164 INFO L471 AbstractCegarLoop]: Abstraction has 4095 states and 7005 transitions. [2025-02-05 17:07:12,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 7005 transitions. [2025-02-05 17:07:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:12,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:12,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:12,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:07:12,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:12,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash -265056879, now seen corresponding path program 1 times [2025-02-05 17:07:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:12,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722196893] [2025-02-05 17:07:12,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:12,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:12,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:12,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:12,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722196893] [2025-02-05 17:07:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722196893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:12,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:12,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351801984] [2025-02-05 17:07:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:12,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:12,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:12,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:12,302 INFO L87 Difference]: Start difference. First operand 4095 states and 7005 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:13,062 INFO L93 Difference]: Finished difference Result 7964 states and 13126 transitions. [2025-02-05 17:07:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:13,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:13,088 INFO L225 Difference]: With dead ends: 7964 [2025-02-05 17:07:13,089 INFO L226 Difference]: Without dead ends: 6010 [2025-02-05 17:07:13,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:13,098 INFO L435 NwaCegarLoop]: 4777 mSDtfsCounter, 5127 mSDsluCounter, 14414 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5147 SdHoareTripleChecker+Valid, 19191 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:13,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5147 Valid, 19191 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2025-02-05 17:07:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 5820. [2025-02-05 17:07:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5820 states, 5550 states have (on average 1.6744144144144144) internal successors, (9293), 5572 states have internal predecessors, (9293), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-02-05 17:07:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5820 states to 5820 states and 9745 transitions. [2025-02-05 17:07:13,251 INFO L78 Accepts]: Start accepts. Automaton has 5820 states and 9745 transitions. Word has length 178 [2025-02-05 17:07:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 5820 states and 9745 transitions. [2025-02-05 17:07:13,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5820 states and 9745 transitions. [2025-02-05 17:07:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:13,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:13,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:13,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:07:13,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 458233554, now seen corresponding path program 1 times [2025-02-05 17:07:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146480126] [2025-02-05 17:07:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:13,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:13,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:13,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:13,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:13,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:13,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146480126] [2025-02-05 17:07:13,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146480126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:13,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:13,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:13,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436286054] [2025-02-05 17:07:13,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:13,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:13,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:13,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:13,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:13,413 INFO L87 Difference]: Start difference. First operand 5820 states and 9745 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:14,148 INFO L93 Difference]: Finished difference Result 13607 states and 22320 transitions. [2025-02-05 17:07:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:14,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:14,189 INFO L225 Difference]: With dead ends: 13607 [2025-02-05 17:07:14,190 INFO L226 Difference]: Without dead ends: 9928 [2025-02-05 17:07:14,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:14,204 INFO L435 NwaCegarLoop]: 4774 mSDtfsCounter, 5122 mSDsluCounter, 14405 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5142 SdHoareTripleChecker+Valid, 19179 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:14,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5142 Valid, 19179 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9928 states. [2025-02-05 17:07:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9928 to 9657. [2025-02-05 17:07:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9657 states, 9125 states have (on average 1.650082191780822) internal successors, (15057), 9193 states have internal predecessors, (15057), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:07:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 16037 transitions. [2025-02-05 17:07:14,551 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 16037 transitions. Word has length 178 [2025-02-05 17:07:14,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:14,552 INFO L471 AbstractCegarLoop]: Abstraction has 9657 states and 16037 transitions. [2025-02-05 17:07:14,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 16037 transitions. [2025-02-05 17:07:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:14,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:14,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:14,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:07:14,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:14,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2144133489, now seen corresponding path program 1 times [2025-02-05 17:07:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:14,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568685554] [2025-02-05 17:07:14,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:14,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:14,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:14,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:14,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:14,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568685554] [2025-02-05 17:07:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568685554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:14,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109082691] [2025-02-05 17:07:14,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:14,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:14,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:14,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:14,762 INFO L87 Difference]: Start difference. First operand 9657 states and 16037 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:15,729 INFO L93 Difference]: Finished difference Result 26382 states and 43938 transitions. [2025-02-05 17:07:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:15,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:15,787 INFO L225 Difference]: With dead ends: 26382 [2025-02-05 17:07:15,788 INFO L226 Difference]: Without dead ends: 18866 [2025-02-05 17:07:15,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:15,812 INFO L435 NwaCegarLoop]: 4771 mSDtfsCounter, 5117 mSDsluCounter, 14396 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5137 SdHoareTripleChecker+Valid, 19167 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:15,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5137 Valid, 19167 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18866 states. [2025-02-05 17:07:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18866 to 18438. [2025-02-05 17:07:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6521814404432134) internal successors, (28629), 17542 states have internal predecessors, (28629), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:07:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 31049 transitions. [2025-02-05 17:07:16,322 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 31049 transitions. Word has length 178 [2025-02-05 17:07:16,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:16,323 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 31049 transitions. [2025-02-05 17:07:16,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 31049 transitions. [2025-02-05 17:07:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:16,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:16,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:16,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:07:16,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:16,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:16,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1957902606, now seen corresponding path program 1 times [2025-02-05 17:07:16,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:16,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891095967] [2025-02-05 17:07:16,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:16,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:16,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:16,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:16,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:16,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:16,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891095967] [2025-02-05 17:07:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891095967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:16,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:16,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637941976] [2025-02-05 17:07:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:16,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:16,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:16,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:16,553 INFO L87 Difference]: Start difference. First operand 18438 states and 31049 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:17,426 INFO L93 Difference]: Finished difference Result 39635 states and 68262 transitions. [2025-02-05 17:07:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:17,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:17,494 INFO L225 Difference]: With dead ends: 39635 [2025-02-05 17:07:17,495 INFO L226 Difference]: Without dead ends: 23338 [2025-02-05 17:07:17,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:17,530 INFO L435 NwaCegarLoop]: 4422 mSDtfsCounter, 4789 mSDsluCounter, 8690 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 13112 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:17,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 13112 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23338 states. [2025-02-05 17:07:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23338 to 18438. [2025-02-05 17:07:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6502770083102494) internal successors, (28596), 17542 states have internal predecessors, (28596), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:07:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 31016 transitions. [2025-02-05 17:07:18,056 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 31016 transitions. Word has length 178 [2025-02-05 17:07:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:18,056 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 31016 transitions. [2025-02-05 17:07:18,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 31016 transitions. [2025-02-05 17:07:18,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:18,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:18,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:18,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:07:18,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:18,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:18,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2090226351, now seen corresponding path program 1 times [2025-02-05 17:07:18,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:18,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292988572] [2025-02-05 17:07:18,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:18,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:18,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:18,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:18,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292988572] [2025-02-05 17:07:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292988572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114744974] [2025-02-05 17:07:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:18,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:18,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:18,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:18,166 INFO L87 Difference]: Start difference. First operand 18438 states and 31016 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:19,001 INFO L93 Difference]: Finished difference Result 39390 states and 67706 transitions. [2025-02-05 17:07:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:19,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:19,088 INFO L225 Difference]: With dead ends: 39390 [2025-02-05 17:07:19,088 INFO L226 Difference]: Without dead ends: 23093 [2025-02-05 17:07:19,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:19,125 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 4786 mSDsluCounter, 8685 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4806 SdHoareTripleChecker+Valid, 13104 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:19,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4806 Valid, 13104 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23093 states. [2025-02-05 17:07:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23093 to 18438. [2025-02-05 17:07:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6483725761772854) internal successors, (28563), 17542 states have internal predecessors, (28563), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:07:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 30983 transitions. [2025-02-05 17:07:19,696 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 30983 transitions. Word has length 178 [2025-02-05 17:07:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:19,697 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 30983 transitions. [2025-02-05 17:07:19,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 30983 transitions. [2025-02-05 17:07:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:19,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:19,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:19,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:07:19,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:19,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1124663534, now seen corresponding path program 1 times [2025-02-05 17:07:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:19,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915210731] [2025-02-05 17:07:19,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:19,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:19,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:19,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:19,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:19,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915210731] [2025-02-05 17:07:19,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915210731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681907321] [2025-02-05 17:07:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:19,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:19,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:19,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:19,829 INFO L87 Difference]: Start difference. First operand 18438 states and 30983 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:21,508 INFO L93 Difference]: Finished difference Result 55629 states and 95618 transitions. [2025-02-05 17:07:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:21,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:21,682 INFO L225 Difference]: With dead ends: 55629 [2025-02-05 17:07:21,682 INFO L226 Difference]: Without dead ends: 39332 [2025-02-05 17:07:21,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:21,709 INFO L435 NwaCegarLoop]: 4758 mSDtfsCounter, 5096 mSDsluCounter, 14359 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 19117 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:21,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 19117 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:07:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39332 states. [2025-02-05 17:07:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39332 to 38673. [2025-02-05 17:07:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6688370809766864) internal successors, (60487), 36913 states have internal predecessors, (60487), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:07:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67323 transitions. [2025-02-05 17:07:22,734 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67323 transitions. Word has length 178 [2025-02-05 17:07:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:22,734 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67323 transitions. [2025-02-05 17:07:22,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67323 transitions. [2025-02-05 17:07:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:22,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:22,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:22,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:07:22,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:22,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:22,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1786253007, now seen corresponding path program 1 times [2025-02-05 17:07:22,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:22,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511870865] [2025-02-05 17:07:22,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:22,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:22,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:22,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:22,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:22,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:22,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511870865] [2025-02-05 17:07:22,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511870865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:22,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:22,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029788189] [2025-02-05 17:07:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:22,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:22,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:22,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:22,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:22,837 INFO L87 Difference]: Start difference. First operand 38673 states and 67323 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:24,616 INFO L93 Difference]: Finished difference Result 87632 states and 157542 transitions. [2025-02-05 17:07:24,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:24,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:24,781 INFO L225 Difference]: With dead ends: 87632 [2025-02-05 17:07:24,781 INFO L226 Difference]: Without dead ends: 51100 [2025-02-05 17:07:24,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:24,853 INFO L435 NwaCegarLoop]: 4381 mSDtfsCounter, 4813 mSDsluCounter, 8643 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4833 SdHoareTripleChecker+Valid, 13024 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:24,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4833 Valid, 13024 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51100 states. [2025-02-05 17:07:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51100 to 38673. [2025-02-05 17:07:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6670437301696786) internal successors, (60422), 36913 states have internal predecessors, (60422), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:07:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67258 transitions. [2025-02-05 17:07:26,762 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67258 transitions. Word has length 178 [2025-02-05 17:07:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:26,763 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67258 transitions. [2025-02-05 17:07:26,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67258 transitions. [2025-02-05 17:07:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:26,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:26,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:07:26,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -837763278, now seen corresponding path program 1 times [2025-02-05 17:07:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713581644] [2025-02-05 17:07:26,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:26,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:26,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:26,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:26,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:26,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:26,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713581644] [2025-02-05 17:07:26,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713581644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:26,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:26,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:26,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879393301] [2025-02-05 17:07:26,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:26,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:26,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:26,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:26,871 INFO L87 Difference]: Start difference. First operand 38673 states and 67258 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:28,363 INFO L93 Difference]: Finished difference Result 86901 states and 155950 transitions. [2025-02-05 17:07:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:28,660 INFO L225 Difference]: With dead ends: 86901 [2025-02-05 17:07:28,660 INFO L226 Difference]: Without dead ends: 50369 [2025-02-05 17:07:28,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:28,779 INFO L435 NwaCegarLoop]: 4411 mSDtfsCounter, 4779 mSDsluCounter, 8671 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4799 SdHoareTripleChecker+Valid, 13082 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:28,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4799 Valid, 13082 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50369 states. [2025-02-05 17:07:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50369 to 38673. [2025-02-05 17:07:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6652503793626707) internal successors, (60357), 36913 states have internal predecessors, (60357), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:07:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67193 transitions. [2025-02-05 17:07:29,958 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67193 transitions. Word has length 178 [2025-02-05 17:07:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:29,958 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67193 transitions. [2025-02-05 17:07:29,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67193 transitions. [2025-02-05 17:07:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:29,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:29,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:29,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:07:29,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:29,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash -668619503, now seen corresponding path program 1 times [2025-02-05 17:07:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:29,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068188908] [2025-02-05 17:07:29,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:29,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:29,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:30,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068188908] [2025-02-05 17:07:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068188908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:30,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975862974] [2025-02-05 17:07:30,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:30,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:30,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:30,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:30,060 INFO L87 Difference]: Start difference. First operand 38673 states and 67193 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:31,663 INFO L93 Difference]: Finished difference Result 86170 states and 154358 transitions. [2025-02-05 17:07:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:31,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:31,852 INFO L225 Difference]: With dead ends: 86170 [2025-02-05 17:07:31,853 INFO L226 Difference]: Without dead ends: 49638 [2025-02-05 17:07:31,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:31,947 INFO L435 NwaCegarLoop]: 4408 mSDtfsCounter, 4776 mSDsluCounter, 8666 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4796 SdHoareTripleChecker+Valid, 13074 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:31,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4796 Valid, 13074 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49638 states. [2025-02-05 17:07:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49638 to 38673. [2025-02-05 17:07:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.663457028555663) internal successors, (60292), 36913 states have internal predecessors, (60292), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:07:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67128 transitions. [2025-02-05 17:07:33,822 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67128 transitions. Word has length 178 [2025-02-05 17:07:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:33,822 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67128 transitions. [2025-02-05 17:07:33,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67128 transitions. [2025-02-05 17:07:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:33,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:33,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:33,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:07:33,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:33,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1692141394, now seen corresponding path program 1 times [2025-02-05 17:07:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:33,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096434552] [2025-02-05 17:07:33,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:33,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:33,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:33,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:33,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096434552] [2025-02-05 17:07:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096434552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:34,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:34,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:34,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927602433] [2025-02-05 17:07:34,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:34,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:34,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:34,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:34,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:34,077 INFO L87 Difference]: Start difference. First operand 38673 states and 67128 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:36,762 INFO L93 Difference]: Finished difference Result 128170 states and 229756 transitions. [2025-02-05 17:07:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:36,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:37,158 INFO L225 Difference]: With dead ends: 128170 [2025-02-05 17:07:37,158 INFO L226 Difference]: Without dead ends: 91638 [2025-02-05 17:07:37,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:37,328 INFO L435 NwaCegarLoop]: 4738 mSDtfsCounter, 5441 mSDsluCounter, 14297 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 19035 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:37,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 19035 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91638 states. [2025-02-05 17:07:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91638 to 84783. [2025-02-05 17:07:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84783 states, 79297 states have (on average 1.6897738880411617) internal successors, (133994), 81359 states have internal predecessors, (133994), 2650 states have call successors, (2650), 774 states have call predecessors, (2650), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-02-05 17:07:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84783 states to 84783 states and 155678 transitions. [2025-02-05 17:07:41,797 INFO L78 Accepts]: Start accepts. Automaton has 84783 states and 155678 transitions. Word has length 178 [2025-02-05 17:07:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:41,798 INFO L471 AbstractCegarLoop]: Abstraction has 84783 states and 155678 transitions. [2025-02-05 17:07:41,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84783 states and 155678 transitions. [2025-02-05 17:07:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:41,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:41,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:41,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:07:41,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:41,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash -725557007, now seen corresponding path program 1 times [2025-02-05 17:07:41,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:41,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050462180] [2025-02-05 17:07:41,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:41,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:41,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:41,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:41,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:41,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050462180] [2025-02-05 17:07:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050462180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998744874] [2025-02-05 17:07:41,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:41,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:41,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:41,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:41,893 INFO L87 Difference]: Start difference. First operand 84783 states and 155678 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:45,062 INFO L93 Difference]: Finished difference Result 195882 states and 374354 transitions. [2025-02-05 17:07:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:45,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-02-05 17:07:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:45,559 INFO L225 Difference]: With dead ends: 195882 [2025-02-05 17:07:45,559 INFO L226 Difference]: Without dead ends: 113240 [2025-02-05 17:07:45,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:45,818 INFO L435 NwaCegarLoop]: 4403 mSDtfsCounter, 4770 mSDsluCounter, 8655 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 13058 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:45,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 13058 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:07:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113240 states. [2025-02-05 17:07:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113240 to 84783. [2025-02-05 17:07:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84783 states, 79297 states have (on average 1.6881470925760118) internal successors, (133865), 81359 states have internal predecessors, (133865), 2650 states have call successors, (2650), 774 states have call predecessors, (2650), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-02-05 17:07:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84783 states to 84783 states and 155549 transitions. [2025-02-05 17:07:50,661 INFO L78 Accepts]: Start accepts. Automaton has 84783 states and 155549 transitions. Word has length 178 [2025-02-05 17:07:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:50,662 INFO L471 AbstractCegarLoop]: Abstraction has 84783 states and 155549 transitions. [2025-02-05 17:07:50,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 84783 states and 155549 transitions. [2025-02-05 17:07:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 17:07:50,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:50,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:50,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:07:50,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:50,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash -803547278, now seen corresponding path program 1 times [2025-02-05 17:07:50,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:50,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642239308] [2025-02-05 17:07:50,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:50,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:50,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 17:07:50,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 17:07:50,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:50,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642239308] [2025-02-05 17:07:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642239308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:50,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:50,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:50,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347721180] [2025-02-05 17:07:50,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:50,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:50,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:50,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:50,783 INFO L87 Difference]: Start difference. First operand 84783 states and 155549 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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)