./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96b7f8eccd086f0147c8c722a1929f411803fa8c06f9cbde3c608e38cc4fa9b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:58:56,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:58:56,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:58:56,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:58:56,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:58:56,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:58:56,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:58:56,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:58:56,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:58:56,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:58:56,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:58:56,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:58:56,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:58:56,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:58:56,132 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:58:56,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:58:56,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:58:56,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:58:56,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:58:56,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:58:56,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:58:56,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:58:56,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:58:56,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:58:56,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:58:56,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:58:56,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:58:56,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:58:56,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:58:56,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:58:56,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:58:56,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:58:56,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:58:56,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:58:56,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:58:56,135 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 -> 96b7f8eccd086f0147c8c722a1929f411803fa8c06f9cbde3c608e38cc4fa9b2 [2025-03-08 06:58:56,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:58:56,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:58:56,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:58:56,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:58:56,371 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:58:56,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.11.cil-2.c [2025-03-08 06:58:57,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0e5cc66/f4a3b465857c4859a6abafb3c43477e8/FLAG207bbf8da [2025-03-08 06:58:58,114 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:58:58,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.11.cil-2.c [2025-03-08 06:58:58,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0e5cc66/f4a3b465857c4859a6abafb3c43477e8/FLAG207bbf8da [2025-03-08 06:58:58,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0e5cc66/f4a3b465857c4859a6abafb3c43477e8 [2025-03-08 06:58:58,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:58:58,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:58:58,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:58:58,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:58:58,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:58:58,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:58:58" (1/1) ... [2025-03-08 06:58:58,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:58, skipping insertion in model container [2025-03-08 06:58:58,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:58:58" (1/1) ... [2025-03-08 06:58:58,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:58:59,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.11.cil-2.c[375709,375722] [2025-03-08 06:58:59,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.11.cil-2.c[383339,383352] [2025-03-08 06:59:00,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:59:00,155 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:59:00,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.11.cil-2.c[375709,375722] [2025-03-08 06:59:00,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.11.cil-2.c[383339,383352] [2025-03-08 06:59:00,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:59:00,735 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:59:00,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00 WrapperNode [2025-03-08 06:59:00,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:59:00,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:59:00,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:59:00,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:59:00,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:00,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,146 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-03-08 06:59:01,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:59:01,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:59:01,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:59:01,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:59:01,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,343 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:59:01,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:59:01,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:59:01,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:59:01,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:59:01,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (1/1) ... [2025-03-08 06:59:01,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:59:01,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:01,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:59:01,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:59:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:59:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:59:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:59:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:59:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:59:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:59:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:59:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:59:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:59:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:59:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:59:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:59:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:59:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:59:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:59:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:59:01,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:59:01,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:59:07,592 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:59:07,592 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:59:07,593 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:59:07,593 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:59:07,593 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:59:07,593 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:59:07,593 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:59:07,852 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2025-03-08 06:59:07,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:59:07,906 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:59:07,906 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:59:07,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:59:07 BoogieIcfgContainer [2025-03-08 06:59:07,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:59:07,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:59:07,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:59:07,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:59:07,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:58:58" (1/3) ... [2025-03-08 06:59:07,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56977032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:59:07, skipping insertion in model container [2025-03-08 06:59:07,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:00" (2/3) ... [2025-03-08 06:59:07,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56977032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:59:07, skipping insertion in model container [2025-03-08 06:59:07,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:59:07" (3/3) ... [2025-03-08 06:59:07,917 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.11.cil-2.c [2025-03-08 06:59:07,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:59:07,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label48+token_ring.11.cil-2.c that has 7 procedures, 2538 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-08 06:59:08,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:59:08,045 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;@30b5cfba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:59:08,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:59:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 2538 states, 2505 states have (on average 1.8383233532934131) internal successors, (4605), 2507 states have internal predecessors, (4605), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 06:59:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:08,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:08,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:08,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:08,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1442643868, now seen corresponding path program 1 times [2025-03-08 06:59:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:08,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801834761] [2025-03-08 06:59:08,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:08,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:08,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:08,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:08,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:08,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:08,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801834761] [2025-03-08 06:59:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801834761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:08,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377174829] [2025-03-08 06:59:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:08,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:08,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:08,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:08,597 INFO L87 Difference]: Start difference. First operand has 2538 states, 2505 states have (on average 1.8383233532934131) internal successors, (4605), 2507 states have internal predecessors, (4605), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:09,305 INFO L93 Difference]: Finished difference Result 5435 states and 9903 transitions. [2025-03-08 06:59:09,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:59:09,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:09,335 INFO L225 Difference]: With dead ends: 5435 [2025-03-08 06:59:09,335 INFO L226 Difference]: Without dead ends: 2846 [2025-03-08 06:59:09,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:09,350 INFO L435 NwaCegarLoop]: 4456 mSDtfsCounter, 5089 mSDsluCounter, 9151 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5108 SdHoareTripleChecker+Valid, 13607 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:09,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5108 Valid, 13607 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:59:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2025-03-08 06:59:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2819. [2025-03-08 06:59:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2759 states have (on average 1.8024646611090975) internal successors, (4973), 2762 states have internal predecessors, (4973), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 06:59:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 5064 transitions. [2025-03-08 06:59:09,484 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 5064 transitions. Word has length 165 [2025-03-08 06:59:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:09,484 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 5064 transitions. [2025-03-08 06:59:09,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 5064 transitions. [2025-03-08 06:59:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:09,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:09,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:09,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:59:09,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:09,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1867744478, now seen corresponding path program 1 times [2025-03-08 06:59:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137728826] [2025-03-08 06:59:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:09,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:09,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:09,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:09,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:09,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137728826] [2025-03-08 06:59:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137728826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:09,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555338644] [2025-03-08 06:59:09,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:09,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:09,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:09,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:09,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:09,796 INFO L87 Difference]: Start difference. First operand 2819 states and 5064 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:10,162 INFO L93 Difference]: Finished difference Result 3570 states and 6279 transitions. [2025-03-08 06:59:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:10,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:10,173 INFO L225 Difference]: With dead ends: 3570 [2025-03-08 06:59:10,174 INFO L226 Difference]: Without dead ends: 2891 [2025-03-08 06:59:10,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:10,177 INFO L435 NwaCegarLoop]: 4375 mSDtfsCounter, 4710 mSDsluCounter, 8605 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4729 SdHoareTripleChecker+Valid, 12980 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:10,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4729 Valid, 12980 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2025-03-08 06:59:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2819. [2025-03-08 06:59:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2759 states have (on average 1.8017397607828924) internal successors, (4971), 2762 states have internal predecessors, (4971), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 06:59:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 5062 transitions. [2025-03-08 06:59:10,251 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 5062 transitions. Word has length 165 [2025-03-08 06:59:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:10,252 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 5062 transitions. [2025-03-08 06:59:10,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 5062 transitions. [2025-03-08 06:59:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:10,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:10,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:10,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:59:10,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:10,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash -549953923, now seen corresponding path program 1 times [2025-03-08 06:59:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:10,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47300506] [2025-03-08 06:59:10,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:10,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:10,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:10,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:10,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47300506] [2025-03-08 06:59:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47300506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:10,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602406597] [2025-03-08 06:59:10,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:10,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:10,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:10,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:10,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:10,445 INFO L87 Difference]: Start difference. First operand 2819 states and 5062 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:11,223 INFO L93 Difference]: Finished difference Result 3939 states and 6863 transitions. [2025-03-08 06:59:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:11,239 INFO L225 Difference]: With dead ends: 3939 [2025-03-08 06:59:11,239 INFO L226 Difference]: Without dead ends: 3260 [2025-03-08 06:59:11,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:11,246 INFO L435 NwaCegarLoop]: 4673 mSDtfsCounter, 5022 mSDsluCounter, 14065 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5041 SdHoareTripleChecker+Valid, 18738 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:11,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5041 Valid, 18738 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:59:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2025-03-08 06:59:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 3141. [2025-03-08 06:59:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3054 states have (on average 1.778323510150622) internal successors, (5431), 3058 states have internal predecessors, (5431), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-08 06:59:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5565 transitions. [2025-03-08 06:59:11,341 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5565 transitions. Word has length 165 [2025-03-08 06:59:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:11,341 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5565 transitions. [2025-03-08 06:59:11,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5565 transitions. [2025-03-08 06:59:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:11,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:11,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:11,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:59:11,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:11,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash -627944194, now seen corresponding path program 1 times [2025-03-08 06:59:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:11,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336764491] [2025-03-08 06:59:11,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:11,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:11,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:11,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:11,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:11,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336764491] [2025-03-08 06:59:11,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336764491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:11,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:11,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736214246] [2025-03-08 06:59:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:11,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:11,534 INFO L87 Difference]: Start difference. First operand 3141 states and 5565 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:12,277 INFO L93 Difference]: Finished difference Result 4966 states and 8493 transitions. [2025-03-08 06:59:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:12,299 INFO L225 Difference]: With dead ends: 4966 [2025-03-08 06:59:12,299 INFO L226 Difference]: Without dead ends: 3965 [2025-03-08 06:59:12,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:12,305 INFO L435 NwaCegarLoop]: 4669 mSDtfsCounter, 5017 mSDsluCounter, 14053 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5036 SdHoareTripleChecker+Valid, 18722 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:12,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5036 Valid, 18722 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:59:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2025-03-08 06:59:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3828. [2025-03-08 06:59:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3828 states, 3685 states have (on average 1.7449118046132972) internal successors, (6430), 3693 states have internal predecessors, (6430), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-08 06:59:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 6656 transitions. [2025-03-08 06:59:12,425 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 6656 transitions. Word has length 165 [2025-03-08 06:59:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:12,425 INFO L471 AbstractCegarLoop]: Abstraction has 3828 states and 6656 transitions. [2025-03-08 06:59:12,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 6656 transitions. [2025-03-08 06:59:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:12,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:12,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:12,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:59:12,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1724844637, now seen corresponding path program 1 times [2025-03-08 06:59:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:12,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444576913] [2025-03-08 06:59:12,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:12,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:12,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:12,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:12,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:12,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:12,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444576913] [2025-03-08 06:59:12,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444576913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:12,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591930823] [2025-03-08 06:59:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:12,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:12,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:12,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:12,597 INFO L87 Difference]: Start difference. First operand 3828 states and 6656 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:13,277 INFO L93 Difference]: Finished difference Result 7187 states and 12090 transitions. [2025-03-08 06:59:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:13,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:13,297 INFO L225 Difference]: With dead ends: 7187 [2025-03-08 06:59:13,297 INFO L226 Difference]: Without dead ends: 5499 [2025-03-08 06:59:13,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:13,303 INFO L435 NwaCegarLoop]: 4666 mSDtfsCounter, 5012 mSDsluCounter, 14044 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5031 SdHoareTripleChecker+Valid, 18710 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:13,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5031 Valid, 18710 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:59:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2025-03-08 06:59:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 5325. [2025-03-08 06:59:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5325 states, 5064 states have (on average 1.7089257503949447) internal successors, (8654), 5086 states have internal predecessors, (8654), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-08 06:59:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 9088 transitions. [2025-03-08 06:59:13,434 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 9088 transitions. Word has length 165 [2025-03-08 06:59:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:13,435 INFO L471 AbstractCegarLoop]: Abstraction has 5325 states and 9088 transitions. [2025-03-08 06:59:13,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 9088 transitions. [2025-03-08 06:59:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:13,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:13,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:13,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:59:13,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:13,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash 830909726, now seen corresponding path program 1 times [2025-03-08 06:59:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654962896] [2025-03-08 06:59:13,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:13,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:13,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:13,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:13,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654962896] [2025-03-08 06:59:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654962896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:13,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:13,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:13,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162205596] [2025-03-08 06:59:13,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:13,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:13,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:13,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:13,568 INFO L87 Difference]: Start difference. First operand 5325 states and 9088 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:14,249 INFO L93 Difference]: Finished difference Result 12102 states and 20272 transitions. [2025-03-08 06:59:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:14,280 INFO L225 Difference]: With dead ends: 12102 [2025-03-08 06:59:14,281 INFO L226 Difference]: Without dead ends: 8917 [2025-03-08 06:59:14,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:14,294 INFO L435 NwaCegarLoop]: 4663 mSDtfsCounter, 5007 mSDsluCounter, 14035 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5026 SdHoareTripleChecker+Valid, 18698 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:14,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5026 Valid, 18698 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:59:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8917 states. [2025-03-08 06:59:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8917 to 8670. [2025-03-08 06:59:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8670 states, 8155 states have (on average 1.6855916615573268) internal successors, (13746), 8223 states have internal predecessors, (13746), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:59:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 14692 transitions. [2025-03-08 06:59:14,491 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 14692 transitions. Word has length 165 [2025-03-08 06:59:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:14,491 INFO L471 AbstractCegarLoop]: Abstraction has 8670 states and 14692 transitions. [2025-03-08 06:59:14,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 14692 transitions. [2025-03-08 06:59:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:14,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:14,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:14,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:59:14,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:14,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1910451773, now seen corresponding path program 1 times [2025-03-08 06:59:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:14,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756255079] [2025-03-08 06:59:14,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:14,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:14,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:14,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:14,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756255079] [2025-03-08 06:59:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756255079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:14,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:14,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:14,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846261652] [2025-03-08 06:59:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:14,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:14,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:14,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:14,592 INFO L87 Difference]: Start difference. First operand 8670 states and 14692 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:15,023 INFO L93 Difference]: Finished difference Result 16694 states and 28424 transitions. [2025-03-08 06:59:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:15,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:15,055 INFO L225 Difference]: With dead ends: 16694 [2025-03-08 06:59:15,055 INFO L226 Difference]: Without dead ends: 10164 [2025-03-08 06:59:15,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:15,073 INFO L435 NwaCegarLoop]: 4362 mSDtfsCounter, 4702 mSDsluCounter, 8580 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4721 SdHoareTripleChecker+Valid, 12942 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:15,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4721 Valid, 12942 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10164 states. [2025-03-08 06:59:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10164 to 8670. [2025-03-08 06:59:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8670 states, 8155 states have (on average 1.683507050889025) internal successors, (13729), 8223 states have internal predecessors, (13729), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:59:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 14675 transitions. [2025-03-08 06:59:15,293 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 14675 transitions. Word has length 165 [2025-03-08 06:59:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:15,293 INFO L471 AbstractCegarLoop]: Abstraction has 8670 states and 14675 transitions. [2025-03-08 06:59:15,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 14675 transitions. [2025-03-08 06:59:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:15,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:15,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:15,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:59:15,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:15,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash -28087524, now seen corresponding path program 1 times [2025-03-08 06:59:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:15,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45810190] [2025-03-08 06:59:15,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:15,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:15,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:15,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:15,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45810190] [2025-03-08 06:59:15,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45810190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:15,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907625754] [2025-03-08 06:59:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:15,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:15,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:15,402 INFO L87 Difference]: Start difference. First operand 8670 states and 14675 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:15,784 INFO L93 Difference]: Finished difference Result 16611 states and 28224 transitions. [2025-03-08 06:59:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:15,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:15,885 INFO L225 Difference]: With dead ends: 16611 [2025-03-08 06:59:15,885 INFO L226 Difference]: Without dead ends: 10081 [2025-03-08 06:59:15,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:15,896 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4699 mSDsluCounter, 8575 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4718 SdHoareTripleChecker+Valid, 12934 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:15,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4718 Valid, 12934 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10081 states. [2025-03-08 06:59:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10081 to 8670. [2025-03-08 06:59:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8670 states, 8155 states have (on average 1.6814224402207234) internal successors, (13712), 8223 states have internal predecessors, (13712), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:59:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 14658 transitions. [2025-03-08 06:59:16,081 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 14658 transitions. Word has length 165 [2025-03-08 06:59:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:16,081 INFO L471 AbstractCegarLoop]: Abstraction has 8670 states and 14658 transitions. [2025-03-08 06:59:16,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 14658 transitions. [2025-03-08 06:59:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:16,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:16,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:16,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:59:16,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:16,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1476094371, now seen corresponding path program 1 times [2025-03-08 06:59:16,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:16,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083759590] [2025-03-08 06:59:16,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:16,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:16,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:16,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:16,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083759590] [2025-03-08 06:59:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083759590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:16,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905159215] [2025-03-08 06:59:16,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:16,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:16,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:16,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:16,199 INFO L87 Difference]: Start difference. First operand 8670 states and 14658 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:17,047 INFO L93 Difference]: Finished difference Result 22977 states and 38876 transitions. [2025-03-08 06:59:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:17,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:17,093 INFO L225 Difference]: With dead ends: 22977 [2025-03-08 06:59:17,094 INFO L226 Difference]: Without dead ends: 16447 [2025-03-08 06:59:17,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:17,114 INFO L435 NwaCegarLoop]: 4646 mSDtfsCounter, 4983 mSDsluCounter, 13988 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5002 SdHoareTripleChecker+Valid, 18634 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:17,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5002 Valid, 18634 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:59:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16447 states. [2025-03-08 06:59:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16447 to 16116. [2025-03-08 06:59:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16116 states, 15039 states have (on average 1.6760422900458807) internal successors, (25206), 15253 states have internal predecessors, (25206), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:59:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16116 states to 16116 states and 27560 transitions. [2025-03-08 06:59:17,656 INFO L78 Accepts]: Start accepts. Automaton has 16116 states and 27560 transitions. Word has length 165 [2025-03-08 06:59:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 16116 states and 27560 transitions. [2025-03-08 06:59:17,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 16116 states and 27560 transitions. [2025-03-08 06:59:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:17,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:17,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:17,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:59:17,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:17,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -137330948, now seen corresponding path program 1 times [2025-03-08 06:59:17,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:17,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804519646] [2025-03-08 06:59:17,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:17,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:17,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:17,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:17,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:17,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:17,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804519646] [2025-03-08 06:59:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804519646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:17,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632238812] [2025-03-08 06:59:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:17,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:17,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:17,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:17,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:17,758 INFO L87 Difference]: Start difference. First operand 16116 states and 27560 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:18,416 INFO L93 Difference]: Finished difference Result 33767 states and 58836 transitions. [2025-03-08 06:59:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:18,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:18,477 INFO L225 Difference]: With dead ends: 33767 [2025-03-08 06:59:18,477 INFO L226 Difference]: Without dead ends: 19791 [2025-03-08 06:59:18,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:18,503 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4695 mSDsluCounter, 8566 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4714 SdHoareTripleChecker+Valid, 12920 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:18,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4714 Valid, 12920 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19791 states. [2025-03-08 06:59:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19791 to 16116. [2025-03-08 06:59:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16116 states, 15039 states have (on average 1.6738479952124476) internal successors, (25173), 15253 states have internal predecessors, (25173), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:59:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16116 states to 16116 states and 27527 transitions. [2025-03-08 06:59:18,932 INFO L78 Accepts]: Start accepts. Automaton has 16116 states and 27527 transitions. Word has length 165 [2025-03-08 06:59:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:18,933 INFO L471 AbstractCegarLoop]: Abstraction has 16116 states and 27527 transitions. [2025-03-08 06:59:18,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 16116 states and 27527 transitions. [2025-03-08 06:59:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:18,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:18,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:18,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:59:18,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:18,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash 44402301, now seen corresponding path program 1 times [2025-03-08 06:59:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:18,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691405778] [2025-03-08 06:59:18,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:18,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:18,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:18,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:18,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691405778] [2025-03-08 06:59:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691405778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392978676] [2025-03-08 06:59:19,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:19,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:19,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:19,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:19,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:19,021 INFO L87 Difference]: Start difference. First operand 16116 states and 27527 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:19,645 INFO L93 Difference]: Finished difference Result 33522 states and 58280 transitions. [2025-03-08 06:59:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:19,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:19,705 INFO L225 Difference]: With dead ends: 33522 [2025-03-08 06:59:19,706 INFO L226 Difference]: Without dead ends: 19546 [2025-03-08 06:59:19,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:19,736 INFO L435 NwaCegarLoop]: 4351 mSDtfsCounter, 4692 mSDsluCounter, 8561 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4711 SdHoareTripleChecker+Valid, 12912 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:19,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4711 Valid, 12912 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19546 states. [2025-03-08 06:59:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19546 to 16116. [2025-03-08 06:59:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16116 states, 15039 states have (on average 1.6716537003790146) internal successors, (25140), 15253 states have internal predecessors, (25140), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:59:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16116 states to 16116 states and 27494 transitions. [2025-03-08 06:59:20,247 INFO L78 Accepts]: Start accepts. Automaton has 16116 states and 27494 transitions. Word has length 165 [2025-03-08 06:59:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:20,247 INFO L471 AbstractCegarLoop]: Abstraction has 16116 states and 27494 transitions. [2025-03-08 06:59:20,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 16116 states and 27494 transitions. [2025-03-08 06:59:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:20,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:20,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:59:20,254 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:20,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash 188811996, now seen corresponding path program 1 times [2025-03-08 06:59:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529334798] [2025-03-08 06:59:20,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:20,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:20,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:20,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:20,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:20,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:20,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529334798] [2025-03-08 06:59:20,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529334798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:20,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:20,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:20,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797998895] [2025-03-08 06:59:20,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:20,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:20,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:20,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:20,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:20,345 INFO L87 Difference]: Start difference. First operand 16116 states and 27494 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:21,687 INFO L93 Difference]: Finished difference Result 49953 states and 86479 transitions. [2025-03-08 06:59:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:21,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:21,809 INFO L225 Difference]: With dead ends: 49953 [2025-03-08 06:59:21,809 INFO L226 Difference]: Without dead ends: 35977 [2025-03-08 06:59:21,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:21,849 INFO L435 NwaCegarLoop]: 4631 mSDtfsCounter, 5306 mSDsluCounter, 13940 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5337 SdHoareTripleChecker+Valid, 18571 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:21,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5337 Valid, 18571 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:59:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35977 states. [2025-03-08 06:59:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35977 to 32775. [2025-03-08 06:59:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 30444 states have (on average 1.6825647089738536) internal successors, (51224), 31112 states have internal predecessors, (51224), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:59:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 57866 transitions. [2025-03-08 06:59:23,273 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 57866 transitions. Word has length 165 [2025-03-08 06:59:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:23,274 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 57866 transitions. [2025-03-08 06:59:23,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 57866 transitions. [2025-03-08 06:59:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:23,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:23,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:59:23,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -83624291, now seen corresponding path program 1 times [2025-03-08 06:59:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697433539] [2025-03-08 06:59:23,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:23,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:23,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:23,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:23,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:23,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:23,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697433539] [2025-03-08 06:59:23,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697433539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:23,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:23,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666549071] [2025-03-08 06:59:23,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:23,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:23,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:23,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:23,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:23,371 INFO L87 Difference]: Start difference. First operand 32775 states and 57866 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:24,549 INFO L93 Difference]: Finished difference Result 72182 states and 131320 transitions. [2025-03-08 06:59:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:24,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:24,681 INFO L225 Difference]: With dead ends: 72182 [2025-03-08 06:59:24,681 INFO L226 Difference]: Without dead ends: 41547 [2025-03-08 06:59:24,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:24,743 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4686 mSDsluCounter, 8550 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4705 SdHoareTripleChecker+Valid, 12896 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:24,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4705 Valid, 12896 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41547 states. [2025-03-08 06:59:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41547 to 32775. [2025-03-08 06:59:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 30444 states have (on average 1.6804296413086321) internal successors, (51159), 31112 states have internal predecessors, (51159), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:59:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 57801 transitions. [2025-03-08 06:59:25,895 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 57801 transitions. Word has length 165 [2025-03-08 06:59:25,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:25,895 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 57801 transitions. [2025-03-08 06:59:25,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 57801 transitions. [2025-03-08 06:59:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:25,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:25,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:25,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:59:25,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:25,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1893527876, now seen corresponding path program 1 times [2025-03-08 06:59:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:25,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816634948] [2025-03-08 06:59:25,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:25,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:25,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:25,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:25,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:25,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:25,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816634948] [2025-03-08 06:59:25,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816634948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:25,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:25,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:25,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375054783] [2025-03-08 06:59:25,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:25,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:25,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:25,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:25,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:25,972 INFO L87 Difference]: Start difference. First operand 32775 states and 57801 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:27,827 INFO L93 Difference]: Finished difference Result 70720 states and 128266 transitions. [2025-03-08 06:59:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:27,993 INFO L225 Difference]: With dead ends: 70720 [2025-03-08 06:59:27,993 INFO L226 Difference]: Without dead ends: 40085 [2025-03-08 06:59:28,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:28,087 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4682 mSDsluCounter, 8541 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4701 SdHoareTripleChecker+Valid, 12882 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:28,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4701 Valid, 12882 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40085 states. [2025-03-08 06:59:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40085 to 32775. [2025-03-08 06:59:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 30444 states have (on average 1.678294573643411) internal successors, (51094), 31112 states have internal predecessors, (51094), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:59:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 57736 transitions. [2025-03-08 06:59:29,811 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 57736 transitions. Word has length 165 [2025-03-08 06:59:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:29,811 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 57736 transitions. [2025-03-08 06:59:29,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 57736 transitions. [2025-03-08 06:59:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:29,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:29,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:29,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:59:29,819 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:29,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2109053595, now seen corresponding path program 1 times [2025-03-08 06:59:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:29,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255332256] [2025-03-08 06:59:29,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:29,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:29,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:29,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:29,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:29,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255332256] [2025-03-08 06:59:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255332256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:29,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405091326] [2025-03-08 06:59:29,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:29,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:29,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:29,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:29,884 INFO L87 Difference]: Start difference. First operand 32775 states and 57736 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:31,143 INFO L93 Difference]: Finished difference Result 69989 states and 126674 transitions. [2025-03-08 06:59:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:31,257 INFO L225 Difference]: With dead ends: 69989 [2025-03-08 06:59:31,258 INFO L226 Difference]: Without dead ends: 39354 [2025-03-08 06:59:31,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:31,310 INFO L435 NwaCegarLoop]: 4338 mSDtfsCounter, 4679 mSDsluCounter, 8536 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 12874 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:31,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 12874 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39354 states. [2025-03-08 06:59:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39354 to 32775. [2025-03-08 06:59:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 30444 states have (on average 1.6761595059781895) internal successors, (51029), 31112 states have internal predecessors, (51029), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:59:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 57671 transitions. [2025-03-08 06:59:32,786 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 57671 transitions. Word has length 165 [2025-03-08 06:59:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:32,786 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 57671 transitions. [2025-03-08 06:59:32,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 57671 transitions. [2025-03-08 06:59:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:32,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:32,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:32,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:59:32,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:32,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash -255682852, now seen corresponding path program 1 times [2025-03-08 06:59:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:32,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880838879] [2025-03-08 06:59:32,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:32,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:32,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:32,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:32,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:32,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880838879] [2025-03-08 06:59:32,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880838879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:32,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:32,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149714587] [2025-03-08 06:59:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:32,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:32,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:32,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:32,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:32,913 INFO L87 Difference]: Start difference. First operand 32775 states and 57671 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:35,754 INFO L93 Difference]: Finished difference Result 103068 states and 187972 transitions. [2025-03-08 06:59:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:59:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:35,971 INFO L225 Difference]: With dead ends: 103068 [2025-03-08 06:59:35,972 INFO L226 Difference]: Without dead ends: 72433 [2025-03-08 06:59:36,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:36,046 INFO L435 NwaCegarLoop]: 4609 mSDtfsCounter, 5124 mSDsluCounter, 13879 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5155 SdHoareTripleChecker+Valid, 18488 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:36,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5155 Valid, 18488 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:59:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72433 states. [2025-03-08 06:59:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72433 to 68670. [2025-03-08 06:59:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68670 states, 63377 states have (on average 1.6851065844075928) internal successors, (106797), 65439 states have internal predecessors, (106797), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-08 06:59:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68670 states to 68670 states and 128095 transitions. [2025-03-08 06:59:39,462 INFO L78 Accepts]: Start accepts. Automaton has 68670 states and 128095 transitions. Word has length 165 [2025-03-08 06:59:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:39,463 INFO L471 AbstractCegarLoop]: Abstraction has 68670 states and 128095 transitions. [2025-03-08 06:59:39,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 68670 states and 128095 transitions. [2025-03-08 06:59:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:59:39,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:39,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:39,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:59:39,479 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:39,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:39,479 INFO L85 PathProgramCache]: Analyzing trace with hash -470512005, now seen corresponding path program 1 times [2025-03-08 06:59:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284309321] [2025-03-08 06:59:39,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:39,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:39,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:59:39,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:59:39,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:39,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:39,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:39,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284309321] [2025-03-08 06:59:39,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284309321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:39,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:39,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581930941] [2025-03-08 06:59:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:39,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:39,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:39,540 INFO L87 Difference]: Start difference. First operand 68670 states and 128095 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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)