./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:35:26,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:35:26,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:35:26,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:35:26,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:35:26,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:35:26,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:35:26,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:35:26,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:35:26,199 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:35:26,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:35:26,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:35:26,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:35:26,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:35:26,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:35:26,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:35:26,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:26,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:35:26,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:35:26,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:35:26,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:35:26,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:35:26,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:35:26,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:35:26,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:35:26,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:35:26,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:35:26,204 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb [2025-03-08 07:35:26,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:35:26,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:35:26,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:35:26,439 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:35:26,439 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:35:26,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2025-03-08 07:35:27,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a560c2b9a/81ae918fdb084a5ea18f5156c066dab1/FLAG4724ddc47 [2025-03-08 07:35:27,891 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:35:27,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2025-03-08 07:35:27,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a560c2b9a/81ae918fdb084a5ea18f5156c066dab1/FLAG4724ddc47 [2025-03-08 07:35:27,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a560c2b9a/81ae918fdb084a5ea18f5156c066dab1 [2025-03-08 07:35:27,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:35:27,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:35:27,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:27,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:35:27,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:35:27,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:27" (1/1) ... [2025-03-08 07:35:27,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bfc908c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:27, skipping insertion in model container [2025-03-08 07:35:27,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:27" (1/1) ... [2025-03-08 07:35:27,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:35:28,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[911,924] [2025-03-08 07:35:28,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[8416,8429] [2025-03-08 07:35:28,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:28,228 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:35:28,236 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[911,924] [2025-03-08 07:35:28,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[8416,8429] [2025-03-08 07:35:28,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:28,310 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:35:28,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28 WrapperNode [2025-03-08 07:35:28,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:28,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:28,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:35:28,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:35:28,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,359 INFO L138 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 821 [2025-03-08 07:35:28,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:28,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:35:28,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:35:28,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:35:28,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,394 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:35:28,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:35:28,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:35:28,420 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:35:28,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:35:28,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (1/1) ... [2025-03-08 07:35:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:28,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:35:28,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:35:28,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:35:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:35:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:35:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:35:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:35:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:35:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:35:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:35:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:35:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:35:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:35:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:35:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:35:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:35:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:35:28,476 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:35:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:35:28,476 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:35:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:35:28,477 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:35:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:35:28,477 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:35:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:35:28,477 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:35:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:35:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:35:28,478 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:35:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:35:28,478 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:35:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:35:28,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:35:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:35:28,478 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:35:28,566 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:35:28,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:35:29,202 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-08 07:35:29,202 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-08 07:35:29,202 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-08 07:35:29,297 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-08 07:35:29,297 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:35:29,309 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:35:29,309 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:35:29,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:29 BoogieIcfgContainer [2025-03-08 07:35:29,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:35:29,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:35:29,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:35:29,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:35:29,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:35:27" (1/3) ... [2025-03-08 07:35:29,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa24d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:29, skipping insertion in model container [2025-03-08 07:35:29,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:28" (2/3) ... [2025-03-08 07:35:29,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa24d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:29, skipping insertion in model container [2025-03-08 07:35:29,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:29" (3/3) ... [2025-03-08 07:35:29,316 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.08.cil-1.c [2025-03-08 07:35:29,325 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:35:29,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.08.cil-1.c that has 15 procedures, 393 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-08 07:35:29,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:35:29,375 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;@583e2efe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:35:29,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:35:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 393 states, 340 states have (on average 1.576470588235294) internal successors, (536), 344 states have internal predecessors, (536), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 07:35:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:29,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:29,389 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] [2025-03-08 07:35:29,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -48141768, now seen corresponding path program 1 times [2025-03-08 07:35:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160178091] [2025-03-08 07:35:29,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:29,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:29,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:29,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:29,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:29,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160178091] [2025-03-08 07:35:29,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160178091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:29,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:29,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:29,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504803285] [2025-03-08 07:35:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:29,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:29,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:29,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:29,775 INFO L87 Difference]: Start difference. First operand has 393 states, 340 states have (on average 1.576470588235294) internal successors, (536), 344 states have internal predecessors, (536), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:30,495 INFO L93 Difference]: Finished difference Result 877 states and 1363 transitions. [2025-03-08 07:35:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-03-08 07:35:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:30,508 INFO L225 Difference]: With dead ends: 877 [2025-03-08 07:35:30,508 INFO L226 Difference]: Without dead ends: 498 [2025-03-08 07:35:30,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:30,513 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 436 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:30,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1256 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-08 07:35:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 491. [2025-03-08 07:35:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 416 states have (on average 1.5192307692307692) internal successors, (632), 422 states have internal predecessors, (632), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2025-03-08 07:35:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 737 transitions. [2025-03-08 07:35:30,576 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 737 transitions. Word has length 63 [2025-03-08 07:35:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:30,577 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 737 transitions. [2025-03-08 07:35:30,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 737 transitions. [2025-03-08 07:35:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:30,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:30,581 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] [2025-03-08 07:35:30,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:35:30,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 956082584, now seen corresponding path program 1 times [2025-03-08 07:35:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772260535] [2025-03-08 07:35:30,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:30,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:30,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:30,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:30,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:30,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:30,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772260535] [2025-03-08 07:35:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772260535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627763902] [2025-03-08 07:35:30,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:30,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:30,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:30,768 INFO L87 Difference]: Start difference. First operand 491 states and 737 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:31,480 INFO L93 Difference]: Finished difference Result 846 states and 1240 transitions. [2025-03-08 07:35:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:31,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-03-08 07:35:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:31,486 INFO L225 Difference]: With dead ends: 846 [2025-03-08 07:35:31,486 INFO L226 Difference]: Without dead ends: 645 [2025-03-08 07:35:31,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:31,487 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 846 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:31,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1511 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-08 07:35:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 599. [2025-03-08 07:35:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 502 states have (on average 1.50199203187251) internal successors, (754), 510 states have internal predecessors, (754), 64 states have call successors, (64), 28 states have call predecessors, (64), 31 states have return successors, (75), 64 states have call predecessors, (75), 62 states have call successors, (75) [2025-03-08 07:35:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 893 transitions. [2025-03-08 07:35:31,524 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 893 transitions. Word has length 63 [2025-03-08 07:35:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:31,525 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 893 transitions. [2025-03-08 07:35:31,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 893 transitions. [2025-03-08 07:35:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:31,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:31,527 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] [2025-03-08 07:35:31,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:35:31,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:31,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 948323225, now seen corresponding path program 1 times [2025-03-08 07:35:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449507949] [2025-03-08 07:35:31,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:31,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:31,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:31,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:31,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:31,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449507949] [2025-03-08 07:35:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449507949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498353296] [2025-03-08 07:35:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:31,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:31,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:31,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:31,629 INFO L87 Difference]: Start difference. First operand 599 states and 893 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:35:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:32,733 INFO L93 Difference]: Finished difference Result 1975 states and 2871 transitions. [2025-03-08 07:35:32,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 63 [2025-03-08 07:35:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:32,745 INFO L225 Difference]: With dead ends: 1975 [2025-03-08 07:35:32,746 INFO L226 Difference]: Without dead ends: 1654 [2025-03-08 07:35:32,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:35:32,749 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 2708 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:32,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2726 Valid, 1701 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:35:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-03-08 07:35:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1607. [2025-03-08 07:35:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1305 states have (on average 1.4199233716475095) internal successors, (1853), 1328 states have internal predecessors, (1853), 174 states have call successors, (174), 111 states have call predecessors, (174), 126 states have return successors, (208), 170 states have call predecessors, (208), 172 states have call successors, (208) [2025-03-08 07:35:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2235 transitions. [2025-03-08 07:35:32,873 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2235 transitions. Word has length 63 [2025-03-08 07:35:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:32,874 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2235 transitions. [2025-03-08 07:35:32,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:35:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2235 transitions. [2025-03-08 07:35:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:32,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:32,877 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] [2025-03-08 07:35:32,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:35:32,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1197301292, now seen corresponding path program 1 times [2025-03-08 07:35:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556035409] [2025-03-08 07:35:32,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:32,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:32,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:32,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:32,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556035409] [2025-03-08 07:35:32,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556035409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:32,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:32,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:32,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659325814] [2025-03-08 07:35:32,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:32,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:32,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:32,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:32,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:32,970 INFO L87 Difference]: Start difference. First operand 1607 states and 2235 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:33,050 INFO L93 Difference]: Finished difference Result 2970 states and 4103 transitions. [2025-03-08 07:35:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:33,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-08 07:35:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:33,060 INFO L225 Difference]: With dead ends: 2970 [2025-03-08 07:35:33,060 INFO L226 Difference]: Without dead ends: 1647 [2025-03-08 07:35:33,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:33,065 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 0 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:33,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2894 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-03-08 07:35:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2025-03-08 07:35:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1337 states have (on average 1.4053851907255048) internal successors, (1879), 1360 states have internal predecessors, (1879), 174 states have call successors, (174), 111 states have call predecessors, (174), 134 states have return successors, (216), 178 states have call predecessors, (216), 172 states have call successors, (216) [2025-03-08 07:35:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2269 transitions. [2025-03-08 07:35:33,145 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2269 transitions. Word has length 64 [2025-03-08 07:35:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:33,145 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2269 transitions. [2025-03-08 07:35:33,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2269 transitions. [2025-03-08 07:35:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:33,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:33,147 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] [2025-03-08 07:35:33,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:35:33,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:33,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:33,147 INFO L85 PathProgramCache]: Analyzing trace with hash 752998963, now seen corresponding path program 1 times [2025-03-08 07:35:33,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:33,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869567156] [2025-03-08 07:35:33,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:33,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:33,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:33,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:33,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:33,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869567156] [2025-03-08 07:35:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869567156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:33,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:33,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:33,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327768262] [2025-03-08 07:35:33,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:33,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:33,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:33,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:33,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:33,239 INFO L87 Difference]: Start difference. First operand 1647 states and 2269 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:34,261 INFO L93 Difference]: Finished difference Result 4866 states and 6686 transitions. [2025-03-08 07:35:34,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:34,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-03-08 07:35:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:34,299 INFO L225 Difference]: With dead ends: 4866 [2025-03-08 07:35:34,299 INFO L226 Difference]: Without dead ends: 1935 [2025-03-08 07:35:34,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:35:34,305 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 2737 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:34,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2755 Valid, 1742 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:35:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-03-08 07:35:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1865. [2025-03-08 07:35:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1483 states have (on average 1.3567093728927848) internal successors, (2012), 1508 states have internal predecessors, (2012), 214 states have call successors, (214), 139 states have call predecessors, (214), 166 states have return successors, (262), 220 states have call predecessors, (262), 212 states have call successors, (262) [2025-03-08 07:35:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2488 transitions. [2025-03-08 07:35:34,394 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2488 transitions. Word has length 64 [2025-03-08 07:35:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:34,395 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2488 transitions. [2025-03-08 07:35:34,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2488 transitions. [2025-03-08 07:35:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:34,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:34,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:34,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:35:34,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:34,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2011414885, now seen corresponding path program 1 times [2025-03-08 07:35:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745529189] [2025-03-08 07:35:34,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:34,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:34,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:34,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:34,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:35:34,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:34,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745529189] [2025-03-08 07:35:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745529189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:34,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:34,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841735240] [2025-03-08 07:35:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:34,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:34,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:34,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:34,471 INFO L87 Difference]: Start difference. First operand 1865 states and 2488 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:34,575 INFO L93 Difference]: Finished difference Result 3506 states and 4641 transitions. [2025-03-08 07:35:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:34,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2025-03-08 07:35:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:34,584 INFO L225 Difference]: With dead ends: 3506 [2025-03-08 07:35:34,585 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:35:34,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:34,589 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:34,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2855 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:35:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:35:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1531 states have (on average 1.341606792945787) internal successors, (2054), 1556 states have internal predecessors, (2054), 214 states have call successors, (214), 139 states have call predecessors, (214), 178 states have return successors, (274), 232 states have call predecessors, (274), 212 states have call successors, (274) [2025-03-08 07:35:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2542 transitions. [2025-03-08 07:35:34,678 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2542 transitions. Word has length 86 [2025-03-08 07:35:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:34,680 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2542 transitions. [2025-03-08 07:35:34,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2542 transitions. [2025-03-08 07:35:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:34,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:34,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:34,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:35:34,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:34,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1041833862, now seen corresponding path program 1 times [2025-03-08 07:35:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055585184] [2025-03-08 07:35:34,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:34,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:34,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:34,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:35:34,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:34,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055585184] [2025-03-08 07:35:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055585184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:34,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005626587] [2025-03-08 07:35:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:34,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:34,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:34,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:34,811 INFO L87 Difference]: Start difference. First operand 1925 states and 2542 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:35,528 INFO L93 Difference]: Finished difference Result 3331 states and 4339 transitions. [2025-03-08 07:35:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:35:35,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2025-03-08 07:35:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:35,538 INFO L225 Difference]: With dead ends: 3331 [2025-03-08 07:35:35,539 INFO L226 Difference]: Without dead ends: 1921 [2025-03-08 07:35:35,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:35:35,543 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 847 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:35,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1288 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-03-08 07:35:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1711. [2025-03-08 07:35:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1370 states have (on average 1.3452554744525547) internal successors, (1843), 1390 states have internal predecessors, (1843), 186 states have call successors, (186), 120 states have call predecessors, (186), 153 states have return successors, (234), 202 states have call predecessors, (234), 184 states have call successors, (234) [2025-03-08 07:35:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2263 transitions. [2025-03-08 07:35:35,632 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2263 transitions. Word has length 86 [2025-03-08 07:35:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:35,632 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2263 transitions. [2025-03-08 07:35:35,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2263 transitions. [2025-03-08 07:35:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:35,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:35,633 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:35,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:35:35,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:35,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:35,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1490530501, now seen corresponding path program 1 times [2025-03-08 07:35:35,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:35,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448341984] [2025-03-08 07:35:35,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:35,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:35,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:35,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:35,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:35,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:35:35,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448341984] [2025-03-08 07:35:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448341984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:35,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:35:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467187040] [2025-03-08 07:35:35,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:35,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:35:35,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:35,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:35:35,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:35:35,691 INFO L87 Difference]: Start difference. First operand 1711 states and 2263 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:35:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:36,149 INFO L93 Difference]: Finished difference Result 4563 states and 5993 transitions. [2025-03-08 07:35:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:35:36,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2025-03-08 07:35:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:36,162 INFO L225 Difference]: With dead ends: 4563 [2025-03-08 07:35:36,162 INFO L226 Difference]: Without dead ends: 3137 [2025-03-08 07:35:36,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:36,166 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 778 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:36,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 649 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2025-03-08 07:35:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 3137. [2025-03-08 07:35:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 2476 states have (on average 1.3037156704361874) internal successors, (3228), 2525 states have internal predecessors, (3228), 347 states have call successors, (347), 233 states have call predecessors, (347), 312 states have return successors, (517), 381 states have call predecessors, (517), 345 states have call successors, (517) [2025-03-08 07:35:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 4092 transitions. [2025-03-08 07:35:36,329 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 4092 transitions. Word has length 86 [2025-03-08 07:35:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:36,330 INFO L471 AbstractCegarLoop]: Abstraction has 3137 states and 4092 transitions. [2025-03-08 07:35:36,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:35:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 4092 transitions. [2025-03-08 07:35:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:36,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:36,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:35:36,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -381715302, now seen corresponding path program 1 times [2025-03-08 07:35:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758598023] [2025-03-08 07:35:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:36,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:36,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:36,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:36,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:35:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758598023] [2025-03-08 07:35:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758598023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:36,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:35:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100549206] [2025-03-08 07:35:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:36,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:35:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:36,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:35:36,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:36,362 INFO L87 Difference]: Start difference. First operand 3137 states and 4092 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:36,422 INFO L93 Difference]: Finished difference Result 4563 states and 5873 transitions. [2025-03-08 07:35:36,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:35:36,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2025-03-08 07:35:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:36,432 INFO L225 Difference]: With dead ends: 4563 [2025-03-08 07:35:36,432 INFO L226 Difference]: Without dead ends: 1711 [2025-03-08 07:35:36,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:36,438 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 137 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:36,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1000 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2025-03-08 07:35:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1711. [2025-03-08 07:35:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1370 states have (on average 1.3182481751824817) internal successors, (1806), 1390 states have internal predecessors, (1806), 186 states have call successors, (186), 120 states have call predecessors, (186), 153 states have return successors, (234), 202 states have call predecessors, (234), 184 states have call successors, (234) [2025-03-08 07:35:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2226 transitions. [2025-03-08 07:35:36,519 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2226 transitions. Word has length 86 [2025-03-08 07:35:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:36,520 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2226 transitions. [2025-03-08 07:35:36,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2226 transitions. [2025-03-08 07:35:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 07:35:36,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:36,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:36,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:35:36,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:36,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2102190256, now seen corresponding path program 1 times [2025-03-08 07:35:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:36,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670948015] [2025-03-08 07:35:36,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:36,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:36,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:35:36,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:35:36,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:36,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:35:36,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:36,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670948015] [2025-03-08 07:35:36,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670948015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:36,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:35:36,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035894465] [2025-03-08 07:35:36,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:36,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:35:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:36,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:35:36,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:35:36,623 INFO L87 Difference]: Start difference. First operand 1711 states and 2226 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:35:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:37,586 INFO L93 Difference]: Finished difference Result 3996 states and 5143 transitions. [2025-03-08 07:35:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:37,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-08 07:35:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:37,597 INFO L225 Difference]: With dead ends: 3996 [2025-03-08 07:35:37,597 INFO L226 Difference]: Without dead ends: 2423 [2025-03-08 07:35:37,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:35:37,601 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 1488 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:37,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1716 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:35:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2025-03-08 07:35:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2302. [2025-03-08 07:35:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 1815 states have (on average 1.28099173553719) internal successors, (2325), 1844 states have internal predecessors, (2325), 257 states have call successors, (257), 170 states have call predecessors, (257), 228 states have return successors, (339), 289 states have call predecessors, (339), 255 states have call successors, (339) [2025-03-08 07:35:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2921 transitions. [2025-03-08 07:35:37,778 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2921 transitions. Word has length 87 [2025-03-08 07:35:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:37,779 INFO L471 AbstractCegarLoop]: Abstraction has 2302 states and 2921 transitions. [2025-03-08 07:35:37,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:35:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2921 transitions. [2025-03-08 07:35:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:37,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:37,781 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] [2025-03-08 07:35:37,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:35:37,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:37,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash 622176633, now seen corresponding path program 1 times [2025-03-08 07:35:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768791765] [2025-03-08 07:35:37,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:37,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:37,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:37,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:37,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:37,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:37,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768791765] [2025-03-08 07:35:37,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768791765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:37,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:37,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:35:37,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62594850] [2025-03-08 07:35:37,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:37,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:35:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:37,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:35:37,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:37,840 INFO L87 Difference]: Start difference. First operand 2302 states and 2921 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:37,950 INFO L93 Difference]: Finished difference Result 2570 states and 3340 transitions. [2025-03-08 07:35:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:35:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 07:35:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:37,963 INFO L225 Difference]: With dead ends: 2570 [2025-03-08 07:35:37,964 INFO L226 Difference]: Without dead ends: 2302 [2025-03-08 07:35:37,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:37,966 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 422 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:37,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 711 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2025-03-08 07:35:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2302. [2025-03-08 07:35:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 1815 states have (on average 1.2804407713498622) internal successors, (2324), 1844 states have internal predecessors, (2324), 257 states have call successors, (257), 170 states have call predecessors, (257), 228 states have return successors, (339), 289 states have call predecessors, (339), 255 states have call successors, (339) [2025-03-08 07:35:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2920 transitions. [2025-03-08 07:35:38,090 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2920 transitions. Word has length 132 [2025-03-08 07:35:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:38,090 INFO L471 AbstractCegarLoop]: Abstraction has 2302 states and 2920 transitions. [2025-03-08 07:35:38,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2920 transitions. [2025-03-08 07:35:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:38,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:38,092 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] [2025-03-08 07:35:38,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:35:38,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:38,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash 191259832, now seen corresponding path program 1 times [2025-03-08 07:35:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:38,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020765134] [2025-03-08 07:35:38,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:38,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:38,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:38,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:38,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020765134] [2025-03-08 07:35:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020765134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:38,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:38,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:38,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66531451] [2025-03-08 07:35:38,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:38,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:38,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:38,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:38,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:38,169 INFO L87 Difference]: Start difference. First operand 2302 states and 2920 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:38,639 INFO L93 Difference]: Finished difference Result 2852 states and 3790 transitions. [2025-03-08 07:35:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:38,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:38,649 INFO L225 Difference]: With dead ends: 2852 [2025-03-08 07:35:38,649 INFO L226 Difference]: Without dead ends: 2593 [2025-03-08 07:35:38,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:38,651 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 989 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:38,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 1352 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2025-03-08 07:35:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2572. [2025-03-08 07:35:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2061 states have (on average 1.316836487142164) internal successors, (2714), 2091 states have internal predecessors, (2714), 274 states have call successors, (274), 176 states have call predecessors, (274), 235 states have return successors, (357), 306 states have call predecessors, (357), 272 states have call successors, (357) [2025-03-08 07:35:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3345 transitions. [2025-03-08 07:35:38,787 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3345 transitions. Word has length 132 [2025-03-08 07:35:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:38,787 INFO L471 AbstractCegarLoop]: Abstraction has 2572 states and 3345 transitions. [2025-03-08 07:35:38,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3345 transitions. [2025-03-08 07:35:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:38,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:38,789 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] [2025-03-08 07:35:38,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:35:38,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:38,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash 632829562, now seen corresponding path program 1 times [2025-03-08 07:35:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:38,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785938868] [2025-03-08 07:35:38,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:38,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:38,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:38,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:38,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:38,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:38,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785938868] [2025-03-08 07:35:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785938868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897465390] [2025-03-08 07:35:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:38,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:38,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:38,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:38,895 INFO L87 Difference]: Start difference. First operand 2572 states and 3345 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:39,535 INFO L93 Difference]: Finished difference Result 3445 states and 4737 transitions. [2025-03-08 07:35:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:39,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:39,546 INFO L225 Difference]: With dead ends: 3445 [2025-03-08 07:35:39,546 INFO L226 Difference]: Without dead ends: 2916 [2025-03-08 07:35:39,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:39,549 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 991 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:39,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2476 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2025-03-08 07:35:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2823. [2025-03-08 07:35:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2288 states have (on average 1.340034965034965) internal successors, (3066), 2319 states have internal predecessors, (3066), 291 states have call successors, (291), 182 states have call predecessors, (291), 242 states have return successors, (377), 324 states have call predecessors, (377), 289 states have call successors, (377) [2025-03-08 07:35:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 3734 transitions. [2025-03-08 07:35:39,697 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 3734 transitions. Word has length 132 [2025-03-08 07:35:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:39,697 INFO L471 AbstractCegarLoop]: Abstraction has 2823 states and 3734 transitions. [2025-03-08 07:35:39,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3734 transitions. [2025-03-08 07:35:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:39,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:39,700 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] [2025-03-08 07:35:39,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:35:39,700 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:39,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash 868507737, now seen corresponding path program 1 times [2025-03-08 07:35:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302468473] [2025-03-08 07:35:39,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:39,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:39,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:39,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:39,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:39,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:39,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302468473] [2025-03-08 07:35:39,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302468473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:39,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:39,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:39,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083543477] [2025-03-08 07:35:39,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:39,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:39,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:39,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:39,813 INFO L87 Difference]: Start difference. First operand 2823 states and 3734 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:40,525 INFO L93 Difference]: Finished difference Result 4244 states and 5995 transitions. [2025-03-08 07:35:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:40,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:40,545 INFO L225 Difference]: With dead ends: 4244 [2025-03-08 07:35:40,546 INFO L226 Difference]: Without dead ends: 3464 [2025-03-08 07:35:40,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:40,549 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 986 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:40,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 2460 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2025-03-08 07:35:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3358. [2025-03-08 07:35:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 2773 states have (on average 1.3808150018031013) internal successors, (3829), 2808 states have internal predecessors, (3829), 325 states have call successors, (325), 194 states have call predecessors, (325), 258 states have return successors, (423), 360 states have call predecessors, (423), 323 states have call successors, (423) [2025-03-08 07:35:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4577 transitions. [2025-03-08 07:35:40,742 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4577 transitions. Word has length 132 [2025-03-08 07:35:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:40,743 INFO L471 AbstractCegarLoop]: Abstraction has 3358 states and 4577 transitions. [2025-03-08 07:35:40,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4577 transitions. [2025-03-08 07:35:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:40,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:40,745 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] [2025-03-08 07:35:40,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:35:40,746 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:40,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash 44826266, now seen corresponding path program 1 times [2025-03-08 07:35:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042968070] [2025-03-08 07:35:40,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:40,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:40,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:40,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:40,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:40,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:40,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042968070] [2025-03-08 07:35:40,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042968070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:40,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:40,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113523485] [2025-03-08 07:35:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:40,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:40,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:40,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:40,848 INFO L87 Difference]: Start difference. First operand 3358 states and 4577 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:41,543 INFO L93 Difference]: Finished difference Result 5969 states and 8768 transitions. [2025-03-08 07:35:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:41,565 INFO L225 Difference]: With dead ends: 5969 [2025-03-08 07:35:41,565 INFO L226 Difference]: Without dead ends: 4654 [2025-03-08 07:35:41,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:41,569 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 981 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:41,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 2448 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2025-03-08 07:35:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4521. [2025-03-08 07:35:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4521 states, 3830 states have (on average 1.441514360313316) internal successors, (5521), 3879 states have internal predecessors, (5521), 393 states have call successors, (393), 218 states have call predecessors, (393), 296 states have return successors, (539), 432 states have call predecessors, (539), 391 states have call successors, (539) [2025-03-08 07:35:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4521 states to 4521 states and 6453 transitions. [2025-03-08 07:35:41,766 INFO L78 Accepts]: Start accepts. Automaton has 4521 states and 6453 transitions. Word has length 132 [2025-03-08 07:35:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 4521 states and 6453 transitions. [2025-03-08 07:35:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4521 states and 6453 transitions. [2025-03-08 07:35:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:41,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:41,768 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] [2025-03-08 07:35:41,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:35:41,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:41,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:41,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1126634553, now seen corresponding path program 1 times [2025-03-08 07:35:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:41,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016455096] [2025-03-08 07:35:41,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:41,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:41,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:41,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:41,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:41,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:41,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016455096] [2025-03-08 07:35:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016455096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:41,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:41,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457332701] [2025-03-08 07:35:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:41,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:41,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:41,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:41,879 INFO L87 Difference]: Start difference. First operand 4521 states and 6453 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:42,631 INFO L93 Difference]: Finished difference Result 9772 states and 15062 transitions. [2025-03-08 07:35:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:42,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:42,654 INFO L225 Difference]: With dead ends: 9772 [2025-03-08 07:35:42,654 INFO L226 Difference]: Without dead ends: 7294 [2025-03-08 07:35:42,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:42,660 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 976 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:42,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 2436 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2025-03-08 07:35:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7108. [2025-03-08 07:35:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 6187 states have (on average 1.5143041861968645) internal successors, (9369), 6282 states have internal predecessors, (9369), 529 states have call successors, (529), 266 states have call predecessors, (529), 390 states have return successors, (867), 576 states have call predecessors, (867), 527 states have call successors, (867) [2025-03-08 07:35:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 10765 transitions. [2025-03-08 07:35:42,925 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 10765 transitions. Word has length 132 [2025-03-08 07:35:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:42,925 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 10765 transitions. [2025-03-08 07:35:42,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 10765 transitions. [2025-03-08 07:35:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:42,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:42,930 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] [2025-03-08 07:35:42,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:35:42,930 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:42,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 607342266, now seen corresponding path program 1 times [2025-03-08 07:35:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166327770] [2025-03-08 07:35:42,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:42,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:42,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:42,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:42,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166327770] [2025-03-08 07:35:43,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166327770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:43,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:43,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:43,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385084387] [2025-03-08 07:35:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:43,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:43,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:43,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:43,066 INFO L87 Difference]: Start difference. First operand 7108 states and 10765 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:43,737 INFO L93 Difference]: Finished difference Result 13335 states and 21379 transitions. [2025-03-08 07:35:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:35:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:43,763 INFO L225 Difference]: With dead ends: 13335 [2025-03-08 07:35:43,763 INFO L226 Difference]: Without dead ends: 8270 [2025-03-08 07:35:43,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:43,776 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 751 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:43,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1006 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8270 states. [2025-03-08 07:35:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8270 to 7108. [2025-03-08 07:35:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 6187 states have (on average 1.511556489413286) internal successors, (9352), 6282 states have internal predecessors, (9352), 529 states have call successors, (529), 266 states have call predecessors, (529), 390 states have return successors, (867), 576 states have call predecessors, (867), 527 states have call successors, (867) [2025-03-08 07:35:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 10748 transitions. [2025-03-08 07:35:44,064 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 10748 transitions. Word has length 132 [2025-03-08 07:35:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:44,066 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 10748 transitions. [2025-03-08 07:35:44,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 10748 transitions. [2025-03-08 07:35:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:44,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:44,070 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] [2025-03-08 07:35:44,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:35:44,070 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:44,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -379240423, now seen corresponding path program 1 times [2025-03-08 07:35:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330260939] [2025-03-08 07:35:44,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:44,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:44,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:44,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:44,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330260939] [2025-03-08 07:35:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330260939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:44,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:44,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390906371] [2025-03-08 07:35:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:44,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:44,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:44,144 INFO L87 Difference]: Start difference. First operand 7108 states and 10748 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:44,695 INFO L93 Difference]: Finished difference Result 13252 states and 21179 transitions. [2025-03-08 07:35:44,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:35:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:44,718 INFO L225 Difference]: With dead ends: 13252 [2025-03-08 07:35:44,719 INFO L226 Difference]: Without dead ends: 8187 [2025-03-08 07:35:44,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:44,730 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 748 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:44,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 998 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2025-03-08 07:35:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 7108. [2025-03-08 07:35:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 6187 states have (on average 1.5088087926297074) internal successors, (9335), 6282 states have internal predecessors, (9335), 529 states have call successors, (529), 266 states have call predecessors, (529), 390 states have return successors, (867), 576 states have call predecessors, (867), 527 states have call successors, (867) [2025-03-08 07:35:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 10731 transitions. [2025-03-08 07:35:45,040 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 10731 transitions. Word has length 132 [2025-03-08 07:35:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:45,040 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 10731 transitions. [2025-03-08 07:35:45,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 10731 transitions. [2025-03-08 07:35:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:45,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:45,044 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] [2025-03-08 07:35:45,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:35:45,044 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:45,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash 697312986, now seen corresponding path program 1 times [2025-03-08 07:35:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:45,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181439549] [2025-03-08 07:35:45,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:45,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:45,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:45,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:45,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181439549] [2025-03-08 07:35:45,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181439549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:45,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:45,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681867476] [2025-03-08 07:35:45,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:45,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:45,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:45,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:45,115 INFO L87 Difference]: Start difference. First operand 7108 states and 10731 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:45,750 INFO L93 Difference]: Finished difference Result 13169 states and 20979 transitions. [2025-03-08 07:35:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:35:45,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:45,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:45,775 INFO L225 Difference]: With dead ends: 13169 [2025-03-08 07:35:45,775 INFO L226 Difference]: Without dead ends: 8104 [2025-03-08 07:35:45,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:45,789 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 745 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:45,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 990 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:35:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2025-03-08 07:35:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 7108. [2025-03-08 07:35:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 6187 states have (on average 1.506061095846129) internal successors, (9318), 6282 states have internal predecessors, (9318), 529 states have call successors, (529), 266 states have call predecessors, (529), 390 states have return successors, (867), 576 states have call predecessors, (867), 527 states have call successors, (867) [2025-03-08 07:35:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 10714 transitions. [2025-03-08 07:35:46,270 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 10714 transitions. Word has length 132 [2025-03-08 07:35:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:46,271 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 10714 transitions. [2025-03-08 07:35:46,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 10714 transitions. [2025-03-08 07:35:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:46,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:46,274 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] [2025-03-08 07:35:46,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:35:46,275 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1761811463, now seen corresponding path program 1 times [2025-03-08 07:35:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748080508] [2025-03-08 07:35:46,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:46,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:46,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:46,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:46,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748080508] [2025-03-08 07:35:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748080508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:46,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320010173] [2025-03-08 07:35:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:46,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:46,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:46,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:46,354 INFO L87 Difference]: Start difference. First operand 7108 states and 10714 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:47,259 INFO L93 Difference]: Finished difference Result 18063 states and 29119 transitions. [2025-03-08 07:35:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:47,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:47,293 INFO L225 Difference]: With dead ends: 18063 [2025-03-08 07:35:47,294 INFO L226 Difference]: Without dead ends: 12998 [2025-03-08 07:35:47,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:47,309 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 947 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:47,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 2367 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12998 states. [2025-03-08 07:35:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12998 to 12768. [2025-03-08 07:35:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12768 states, 11333 states have (on average 1.5678108179652344) internal successors, (17768), 11574 states have internal predecessors, (17768), 801 states have call successors, (801), 362 states have call predecessors, (801), 632 states have return successors, (1907), 864 states have call predecessors, (1907), 799 states have call successors, (1907) [2025-03-08 07:35:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12768 states to 12768 states and 20476 transitions. [2025-03-08 07:35:47,828 INFO L78 Accepts]: Start accepts. Automaton has 12768 states and 20476 transitions. Word has length 132 [2025-03-08 07:35:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:47,829 INFO L471 AbstractCegarLoop]: Abstraction has 12768 states and 20476 transitions. [2025-03-08 07:35:47,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12768 states and 20476 transitions. [2025-03-08 07:35:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:47,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:47,841 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] [2025-03-08 07:35:47,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:35:47,841 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:47,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1702590726, now seen corresponding path program 1 times [2025-03-08 07:35:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:47,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085313473] [2025-03-08 07:35:47,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:47,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:47,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:47,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:47,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:47,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085313473] [2025-03-08 07:35:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085313473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:47,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:47,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545049738] [2025-03-08 07:35:47,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:47,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:47,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:47,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:47,940 INFO L87 Difference]: Start difference. First operand 12768 states and 20476 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:49,403 INFO L93 Difference]: Finished difference Result 38675 states and 65776 transitions. [2025-03-08 07:35:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:49,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:49,533 INFO L225 Difference]: With dead ends: 38675 [2025-03-08 07:35:49,534 INFO L226 Difference]: Without dead ends: 27950 [2025-03-08 07:35:49,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:49,564 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1196 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:49,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 2342 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27950 states. [2025-03-08 07:35:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27950 to 25531. [2025-03-08 07:35:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25531 states, 22938 states have (on average 1.6208910977417386) internal successors, (37180), 23633 states have internal predecessors, (37180), 1313 states have call successors, (1313), 554 states have call predecessors, (1313), 1278 states have return successors, (5491), 1408 states have call predecessors, (5491), 1311 states have call successors, (5491) [2025-03-08 07:35:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25531 states to 25531 states and 43984 transitions. [2025-03-08 07:35:50,799 INFO L78 Accepts]: Start accepts. Automaton has 25531 states and 43984 transitions. Word has length 132 [2025-03-08 07:35:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:50,799 INFO L471 AbstractCegarLoop]: Abstraction has 25531 states and 43984 transitions. [2025-03-08 07:35:50,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 25531 states and 43984 transitions. [2025-03-08 07:35:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:50,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:50,808 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] [2025-03-08 07:35:50,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:35:50,808 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:50,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1007943719, now seen corresponding path program 1 times [2025-03-08 07:35:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188885094] [2025-03-08 07:35:50,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:50,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:50,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:50,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:50,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188885094] [2025-03-08 07:35:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188885094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:50,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109371518] [2025-03-08 07:35:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:50,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:50,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:50,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:50,880 INFO L87 Difference]: Start difference. First operand 25531 states and 43984 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:53,374 INFO L93 Difference]: Finished difference Result 82788 states and 151962 transitions. [2025-03-08 07:35:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:35:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:53,609 INFO L225 Difference]: With dead ends: 82788 [2025-03-08 07:35:53,610 INFO L226 Difference]: Without dead ends: 59300 [2025-03-08 07:35:53,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:53,689 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 1160 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:53,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 2326 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59300 states. [2025-03-08 07:35:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59300 to 54836. [2025-03-08 07:35:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54836 states, 49473 states have (on average 1.6628059749762496) internal successors, (82264), 51562 states have internal predecessors, (82264), 2305 states have call successors, (2305), 938 states have call predecessors, (2305), 3056 states have return successors, (18771), 2464 states have call predecessors, (18771), 2303 states have call successors, (18771) [2025-03-08 07:35:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54836 states to 54836 states and 103340 transitions. [2025-03-08 07:35:56,910 INFO L78 Accepts]: Start accepts. Automaton has 54836 states and 103340 transitions. Word has length 132 [2025-03-08 07:35:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:56,910 INFO L471 AbstractCegarLoop]: Abstraction has 54836 states and 103340 transitions. [2025-03-08 07:35:56,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 54836 states and 103340 transitions. [2025-03-08 07:35:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:35:56,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:56,922 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] [2025-03-08 07:35:56,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:35:56,922 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:56,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash 122842906, now seen corresponding path program 1 times [2025-03-08 07:35:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:56,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497879020] [2025-03-08 07:35:56,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:35:56,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:35:56,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:56,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:56,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-03-08 07:35:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497879020] [2025-03-08 07:35:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497879020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:56,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:56,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:56,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906601128] [2025-03-08 07:35:56,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:56,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:56,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:56,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:56,989 INFO L87 Difference]: Start difference. First operand 54836 states and 103340 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:02,706 INFO L93 Difference]: Finished difference Result 184707 states and 376928 transitions. [2025-03-08 07:36:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:02,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:36:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:03,282 INFO L225 Difference]: With dead ends: 184707 [2025-03-08 07:36:03,282 INFO L226 Difference]: Without dead ends: 131914 [2025-03-08 07:36:03,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:03,463 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1126 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:03,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 2318 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:36:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131914 states. [2025-03-08 07:36:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131914 to 124445. [2025-03-08 07:36:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124445 states, 112148 states have (on average 1.6958305096836324) internal successors, (190184), 118483 states have internal predecessors, (190184), 4225 states have call successors, (4225), 1706 states have call predecessors, (4225), 8070 states have return successors, (69843), 4512 states have call predecessors, (69843), 4223 states have call successors, (69843) [2025-03-08 07:36:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124445 states to 124445 states and 264252 transitions. [2025-03-08 07:36:11,246 INFO L78 Accepts]: Start accepts. Automaton has 124445 states and 264252 transitions. Word has length 132 [2025-03-08 07:36:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:11,246 INFO L471 AbstractCegarLoop]: Abstraction has 124445 states and 264252 transitions. [2025-03-08 07:36:11,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 124445 states and 264252 transitions. [2025-03-08 07:36:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:36:11,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:11,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:11,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:36:11,276 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -810511431, now seen corresponding path program 1 times [2025-03-08 07:36:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095631822] [2025-03-08 07:36:11,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:11,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:36:11,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:36:11,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:11,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:11,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095631822] [2025-03-08 07:36:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095631822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:11,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:11,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:11,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327115408] [2025-03-08 07:36:11,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:11,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:11,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:11,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:11,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:11,345 INFO L87 Difference]: Start difference. First operand 124445 states and 264252 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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)