./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label45+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 59889c869f0503702a707a8a5c510d219998ebb909bdbb124a0f8dd8888d2da1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:02:33,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:02:33,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:02:33,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:02:33,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:02:33,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:02:33,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:02:33,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:02:33,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:02:33,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:02:33,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:02:33,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:02:33,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:02:33,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:02:33,410 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:02:33,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:02:33,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:02:33,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:02:33,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:02:33,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:02:33,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:02:33,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:02:33,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:02:33,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:02:33,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:02:33,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:02:33,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:02:33,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:02:33,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:02:33,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:02:33,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:02:33,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:02:33,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:02:33,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:02:33,413 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 -> 59889c869f0503702a707a8a5c510d219998ebb909bdbb124a0f8dd8888d2da1 [2025-03-16 20:02:33,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:02:33,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:02:33,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:02:33,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:02:33,650 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:02:33,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.11.cil-2.c [2025-03-16 20:02:34,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639b54053/13ba51e05b3d4f71b2e4168810e8f8bc/FLAGab31a8ba5 [2025-03-16 20:02:35,383 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:02:35,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.11.cil-2.c [2025-03-16 20:02:35,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639b54053/13ba51e05b3d4f71b2e4168810e8f8bc/FLAGab31a8ba5 [2025-03-16 20:02:35,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639b54053/13ba51e05b3d4f71b2e4168810e8f8bc [2025-03-16 20:02:35,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:02:35,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:02:35,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:02:35,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:02:35,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:02:35,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:02:35" (1/1) ... [2025-03-16 20:02:35,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91113e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:35, skipping insertion in model container [2025-03-16 20:02:35,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:02:35" (1/1) ... [2025-03-16 20:02:35,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:02:36,639 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_label45+token_ring.11.cil-2.c[380323,380336] [2025-03-16 20:02:36,669 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_label45+token_ring.11.cil-2.c[383339,383352] [2025-03-16 20:02:36,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:02:36,939 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:02:37,473 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_label45+token_ring.11.cil-2.c[380323,380336] [2025-03-16 20:02:37,477 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_label45+token_ring.11.cil-2.c[383339,383352] [2025-03-16 20:02:37,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:02:37,544 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:02:37,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37 WrapperNode [2025-03-16 20:02:37,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:02:37,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:02:37,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:02:37,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:02:37,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:37,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:37,976 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-03-16 20:02:37,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:02:37,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:02:37,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:02:37,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:02:37,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:37,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,133 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-16 20:02:38,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:02:38,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:02:38,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:02:38,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:02:38,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (1/1) ... [2025-03-16 20:02:38,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:02:38,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:38,523 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-16 20:02:38,525 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-16 20:02:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:02:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:02:38,543 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:02:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:02:38,544 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:02:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:02:38,544 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:02:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:02:38,544 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:02:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:02:38,545 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:02:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:02:38,545 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:02:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:02:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:02:38,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:02:38,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:02:38,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:02:44,611 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:02:44,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:02:44,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:02:44,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:02:44,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:02:44,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:02:44,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:02:44,876 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2025-03-16 20:02:44,877 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:02:44,933 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:02:44,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:02:44,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:02:44 BoogieIcfgContainer [2025-03-16 20:02:44,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:02:44,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:02:44,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:02:44,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:02:44,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:02:35" (1/3) ... [2025-03-16 20:02:44,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0787e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:02:44, skipping insertion in model container [2025-03-16 20:02:44,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:37" (2/3) ... [2025-03-16 20:02:44,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0787e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:02:44, skipping insertion in model container [2025-03-16 20:02:44,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:02:44" (3/3) ... [2025-03-16 20:02:44,946 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.11.cil-2.c [2025-03-16 20:02:44,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:02:44,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.11.cil-2.c that has 7 procedures, 2460 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-16 20:02:45,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:02:45,065 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;@17953b38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:02:45,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:02:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 2460 states, 2427 states have (on average 1.8652657601977751) internal successors, (4527), 2429 states have internal predecessors, (4527), 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-16 20:02:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:45,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:45,093 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] [2025-03-16 20:02:45,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:45,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1933840795, now seen corresponding path program 1 times [2025-03-16 20:02:45,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:45,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178097699] [2025-03-16 20:02:45,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:45,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:45,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:45,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:45,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:45,636 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-16 20:02:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178097699] [2025-03-16 20:02:45,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178097699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:45,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475792939] [2025-03-16 20:02:45,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:45,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:45,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:45,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:45,669 INFO L87 Difference]: Start difference. First operand has 2460 states, 2427 states have (on average 1.8652657601977751) internal successors, (4527), 2429 states have internal predecessors, (4527), 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 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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-16 20:02:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:46,658 INFO L93 Difference]: Finished difference Result 5268 states and 9736 transitions. [2025-03-16 20:02:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:02:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:46,691 INFO L225 Difference]: With dead ends: 5268 [2025-03-16 20:02:46,691 INFO L226 Difference]: Without dead ends: 2817 [2025-03-16 20:02:46,702 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-16 20:02:46,705 INFO L435 NwaCegarLoop]: 4389 mSDtfsCounter, 4991 mSDsluCounter, 9014 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5010 SdHoareTripleChecker+Valid, 13403 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:46,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5010 Valid, 13403 Invalid, 609 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:02:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-03-16 20:02:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2790. [2025-03-16 20:02:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2730 states have (on average 1.810989010989011) internal successors, (4944), 2733 states have internal predecessors, (4944), 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-16 20:02:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 5035 transitions. [2025-03-16 20:02:46,864 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 5035 transitions. Word has length 151 [2025-03-16 20:02:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:46,865 INFO L471 AbstractCegarLoop]: Abstraction has 2790 states and 5035 transitions. [2025-03-16 20:02:46,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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-16 20:02:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 5035 transitions. [2025-03-16 20:02:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:46,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:46,873 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] [2025-03-16 20:02:46,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:02:46,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:46,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash 153029927, now seen corresponding path program 1 times [2025-03-16 20:02:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:46,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520763089] [2025-03-16 20:02:46,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:46,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:46,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:46,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:46,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:47,091 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-16 20:02:47,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:47,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520763089] [2025-03-16 20:02:47,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520763089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:47,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:47,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494347754] [2025-03-16 20:02:47,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:47,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:47,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:47,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:47,093 INFO L87 Difference]: Start difference. First operand 2790 states and 5035 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:47,450 INFO L93 Difference]: Finished difference Result 3514 states and 6223 transitions. [2025-03-16 20:02:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:47,462 INFO L225 Difference]: With dead ends: 3514 [2025-03-16 20:02:47,463 INFO L226 Difference]: Without dead ends: 2862 [2025-03-16 20:02:47,466 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-16 20:02:47,467 INFO L435 NwaCegarLoop]: 4371 mSDtfsCounter, 4684 mSDsluCounter, 8597 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4703 SdHoareTripleChecker+Valid, 12968 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:47,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4703 Valid, 12968 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:02:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2025-03-16 20:02:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2790. [2025-03-16 20:02:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2730 states have (on average 1.8102564102564103) internal successors, (4942), 2733 states have internal predecessors, (4942), 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-16 20:02:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 5033 transitions. [2025-03-16 20:02:47,536 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 5033 transitions. Word has length 151 [2025-03-16 20:02:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:47,537 INFO L471 AbstractCegarLoop]: Abstraction has 2790 states and 5033 transitions. [2025-03-16 20:02:47,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 5033 transitions. [2025-03-16 20:02:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:47,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:47,539 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] [2025-03-16 20:02:47,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:02:47,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:47,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1656873658, now seen corresponding path program 1 times [2025-03-16 20:02:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:47,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666341244] [2025-03-16 20:02:47,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:47,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:47,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:47,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:47,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:47,710 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-16 20:02:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666341244] [2025-03-16 20:02:47,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666341244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:47,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690060098] [2025-03-16 20:02:47,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:47,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:47,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:47,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:47,713 INFO L87 Difference]: Start difference. First operand 2790 states and 5033 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:48,421 INFO L93 Difference]: Finished difference Result 3865 states and 6784 transitions. [2025-03-16 20:02:48,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:48,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:48,432 INFO L225 Difference]: With dead ends: 3865 [2025-03-16 20:02:48,433 INFO L226 Difference]: Without dead ends: 3213 [2025-03-16 20:02:48,434 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-16 20:02:48,435 INFO L435 NwaCegarLoop]: 4664 mSDtfsCounter, 4982 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5001 SdHoareTripleChecker+Valid, 18702 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:48,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5001 Valid, 18702 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2025-03-16 20:02:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3098. [2025-03-16 20:02:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 3011 states have (on average 1.7891066090999668) internal successors, (5387), 3015 states have internal predecessors, (5387), 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-16 20:02:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 5521 transitions. [2025-03-16 20:02:48,507 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 5521 transitions. Word has length 151 [2025-03-16 20:02:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:48,508 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 5521 transitions. [2025-03-16 20:02:48,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 5521 transitions. [2025-03-16 20:02:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:48,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:48,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:02:48,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:02:48,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:48,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:48,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1949259483, now seen corresponding path program 1 times [2025-03-16 20:02:48,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:48,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415959567] [2025-03-16 20:02:48,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:48,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:48,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:48,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:48,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:48,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:48,645 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-16 20:02:48,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:48,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415959567] [2025-03-16 20:02:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415959567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:48,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:48,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:48,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236536872] [2025-03-16 20:02:48,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:48,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:48,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:48,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:48,647 INFO L87 Difference]: Start difference. First operand 3098 states and 5521 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:49,279 INFO L93 Difference]: Finished difference Result 4847 states and 8363 transitions. [2025-03-16 20:02:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:49,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:49,294 INFO L225 Difference]: With dead ends: 4847 [2025-03-16 20:02:49,295 INFO L226 Difference]: Without dead ends: 3887 [2025-03-16 20:02:49,299 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-16 20:02:49,300 INFO L435 NwaCegarLoop]: 4660 mSDtfsCounter, 4977 mSDsluCounter, 14026 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4996 SdHoareTripleChecker+Valid, 18686 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:49,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4996 Valid, 18686 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2025-03-16 20:02:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3755. [2025-03-16 20:02:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3612 states have (on average 1.7585825027685493) internal successors, (6352), 3620 states have internal predecessors, (6352), 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-16 20:02:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 6578 transitions. [2025-03-16 20:02:49,391 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 6578 transitions. Word has length 151 [2025-03-16 20:02:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:49,391 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 6578 transitions. [2025-03-16 20:02:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 6578 transitions. [2025-03-16 20:02:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:49,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:49,397 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] [2025-03-16 20:02:49,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:02:49,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:49,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash -19028634, now seen corresponding path program 1 times [2025-03-16 20:02:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980430375] [2025-03-16 20:02:49,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:49,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:49,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:49,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:49,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:49,520 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-16 20:02:49,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980430375] [2025-03-16 20:02:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980430375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:49,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009251797] [2025-03-16 20:02:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:49,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:49,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:49,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:49,522 INFO L87 Difference]: Start difference. First operand 3755 states and 6578 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:50,208 INFO L93 Difference]: Finished difference Result 6970 states and 11842 transitions. [2025-03-16 20:02:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:50,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:50,230 INFO L225 Difference]: With dead ends: 6970 [2025-03-16 20:02:50,230 INFO L226 Difference]: Without dead ends: 5353 [2025-03-16 20:02:50,237 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-16 20:02:50,238 INFO L435 NwaCegarLoop]: 4657 mSDtfsCounter, 4972 mSDsluCounter, 14017 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4991 SdHoareTripleChecker+Valid, 18674 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:50,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4991 Valid, 18674 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:02:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2025-03-16 20:02:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 5186. [2025-03-16 20:02:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 4925 states have (on average 1.7250761421319798) internal successors, (8496), 4947 states have internal predecessors, (8496), 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-16 20:02:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 8930 transitions. [2025-03-16 20:02:50,391 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 8930 transitions. Word has length 151 [2025-03-16 20:02:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:50,391 INFO L471 AbstractCegarLoop]: Abstraction has 5186 states and 8930 transitions. [2025-03-16 20:02:50,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 8930 transitions. [2025-03-16 20:02:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:50,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:50,395 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] [2025-03-16 20:02:50,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:02:50,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:50,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash -233857787, now seen corresponding path program 1 times [2025-03-16 20:02:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:50,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422134290] [2025-03-16 20:02:50,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:50,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:50,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:50,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:50,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:50,521 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-16 20:02:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422134290] [2025-03-16 20:02:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422134290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:50,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:50,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469265395] [2025-03-16 20:02:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:50,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:50,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:50,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:50,524 INFO L87 Difference]: Start difference. First operand 5186 states and 8930 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:51,517 INFO L93 Difference]: Finished difference Result 11665 states and 19740 transitions. [2025-03-16 20:02:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:51,548 INFO L225 Difference]: With dead ends: 11665 [2025-03-16 20:02:51,549 INFO L226 Difference]: Without dead ends: 8617 [2025-03-16 20:02:51,559 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-16 20:02:51,559 INFO L435 NwaCegarLoop]: 4654 mSDtfsCounter, 4967 mSDsluCounter, 14008 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4986 SdHoareTripleChecker+Valid, 18662 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:51,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4986 Valid, 18662 Invalid, 999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:02:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2025-03-16 20:02:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 8381. [2025-03-16 20:02:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7866 states have (on average 1.702517162471396) internal successors, (13392), 7934 states have internal predecessors, (13392), 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-16 20:02:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 14338 transitions. [2025-03-16 20:02:51,788 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 14338 transitions. Word has length 151 [2025-03-16 20:02:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:51,788 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 14338 transitions. [2025-03-16 20:02:51,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 14338 transitions. [2025-03-16 20:02:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:51,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:51,793 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] [2025-03-16 20:02:51,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:02:51,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:51,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1560327558, now seen corresponding path program 1 times [2025-03-16 20:02:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859706350] [2025-03-16 20:02:51,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:51,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:51,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:51,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:51,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:51,892 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-16 20:02:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859706350] [2025-03-16 20:02:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859706350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850831467] [2025-03-16 20:02:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:51,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:51,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:51,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:51,895 INFO L87 Difference]: Start difference. First operand 8381 states and 14338 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:52,321 INFO L93 Difference]: Finished difference Result 16118 states and 27718 transitions. [2025-03-16 20:02:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:52,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:52,359 INFO L225 Difference]: With dead ends: 16118 [2025-03-16 20:02:52,359 INFO L226 Difference]: Without dead ends: 9875 [2025-03-16 20:02:52,378 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-16 20:02:52,380 INFO L435 NwaCegarLoop]: 4358 mSDtfsCounter, 4676 mSDsluCounter, 8572 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4695 SdHoareTripleChecker+Valid, 12930 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:52,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4695 Valid, 12930 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9875 states. [2025-03-16 20:02:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9875 to 8381. [2025-03-16 20:02:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7866 states have (on average 1.7003559623696924) internal successors, (13375), 7934 states have internal predecessors, (13375), 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-16 20:02:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 14321 transitions. [2025-03-16 20:02:52,639 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 14321 transitions. Word has length 151 [2025-03-16 20:02:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:52,639 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 14321 transitions. [2025-03-16 20:02:52,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 14321 transitions. [2025-03-16 20:02:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:52,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:52,644 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] [2025-03-16 20:02:52,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:02:52,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:52,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2033846501, now seen corresponding path program 1 times [2025-03-16 20:02:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498368030] [2025-03-16 20:02:52,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:52,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:52,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:52,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:52,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:52,787 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-16 20:02:52,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498368030] [2025-03-16 20:02:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498368030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666538778] [2025-03-16 20:02:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:52,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:52,789 INFO L87 Difference]: Start difference. First operand 8381 states and 14321 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:53,173 INFO L93 Difference]: Finished difference Result 16035 states and 27518 transitions. [2025-03-16 20:02:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:53,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:53,203 INFO L225 Difference]: With dead ends: 16035 [2025-03-16 20:02:53,203 INFO L226 Difference]: Without dead ends: 9792 [2025-03-16 20:02:53,221 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-16 20:02:53,222 INFO L435 NwaCegarLoop]: 4355 mSDtfsCounter, 4673 mSDsluCounter, 8567 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 12922 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:53,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 12922 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2025-03-16 20:02:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 8381. [2025-03-16 20:02:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7866 states have (on average 1.6981947622679887) internal successors, (13358), 7934 states have internal predecessors, (13358), 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-16 20:02:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 14304 transitions. [2025-03-16 20:02:53,662 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 14304 transitions. Word has length 151 [2025-03-16 20:02:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 14304 transitions. [2025-03-16 20:02:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 14304 transitions. [2025-03-16 20:02:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:53,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:53,675 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] [2025-03-16 20:02:53,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:02:53,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:53,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1830203994, now seen corresponding path program 1 times [2025-03-16 20:02:53,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:53,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320126070] [2025-03-16 20:02:53,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:53,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:53,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:53,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:53,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:53,898 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-16 20:02:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320126070] [2025-03-16 20:02:53,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320126070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:53,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518612098] [2025-03-16 20:02:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:53,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:53,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:53,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:53,901 INFO L87 Difference]: Start difference. First operand 8381 states and 14304 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:54,708 INFO L93 Difference]: Finished difference Result 22128 states and 37832 transitions. [2025-03-16 20:02:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:54,757 INFO L225 Difference]: With dead ends: 22128 [2025-03-16 20:02:54,757 INFO L226 Difference]: Without dead ends: 15885 [2025-03-16 20:02:54,774 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-16 20:02:54,775 INFO L435 NwaCegarLoop]: 4641 mSDtfsCounter, 4946 mSDsluCounter, 13971 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4965 SdHoareTripleChecker+Valid, 18612 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:54,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4965 Valid, 18612 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15885 states. [2025-03-16 20:02:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15885 to 15554. [2025-03-16 20:02:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15554 states, 14477 states have (on average 1.6933066243006147) internal successors, (24514), 14691 states have internal predecessors, (24514), 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-16 20:02:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15554 states to 15554 states and 26868 transitions. [2025-03-16 20:02:55,288 INFO L78 Accepts]: Start accepts. Automaton has 15554 states and 26868 transitions. Word has length 151 [2025-03-16 20:02:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:55,288 INFO L471 AbstractCegarLoop]: Abstraction has 15554 states and 26868 transitions. [2025-03-16 20:02:55,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 15554 states and 26868 transitions. [2025-03-16 20:02:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:55,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:55,295 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] [2025-03-16 20:02:55,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:02:55,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:55,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash -707924795, now seen corresponding path program 1 times [2025-03-16 20:02:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139914612] [2025-03-16 20:02:55,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:55,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:55,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:55,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:55,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:55,386 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-16 20:02:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139914612] [2025-03-16 20:02:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139914612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:55,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572491623] [2025-03-16 20:02:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:55,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:55,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:55,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:55,388 INFO L87 Difference]: Start difference. First operand 15554 states and 26868 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:56,175 INFO L93 Difference]: Finished difference Result 32400 states and 56964 transitions. [2025-03-16 20:02:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:56,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:56,244 INFO L225 Difference]: With dead ends: 32400 [2025-03-16 20:02:56,244 INFO L226 Difference]: Without dead ends: 18984 [2025-03-16 20:02:56,278 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-16 20:02:56,279 INFO L435 NwaCegarLoop]: 4348 mSDtfsCounter, 4668 mSDsluCounter, 8554 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 12902 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:56,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4687 Valid, 12902 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18984 states. [2025-03-16 20:02:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18984 to 15554. [2025-03-16 20:02:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15554 states, 14477 states have (on average 1.6910271465082545) internal successors, (24481), 14691 states have internal predecessors, (24481), 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-16 20:02:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15554 states to 15554 states and 26835 transitions. [2025-03-16 20:02:56,867 INFO L78 Accepts]: Start accepts. Automaton has 15554 states and 26835 transitions. Word has length 151 [2025-03-16 20:02:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:56,867 INFO L471 AbstractCegarLoop]: Abstraction has 15554 states and 26835 transitions. [2025-03-16 20:02:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 15554 states and 26835 transitions. [2025-03-16 20:02:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:02:56,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:56,875 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] [2025-03-16 20:02:56,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:02:56,876 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:56,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash 893241252, now seen corresponding path program 1 times [2025-03-16 20:02:56,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:56,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710720521] [2025-03-16 20:02:56,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:56,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:02:56,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:02:56,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:56,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:56,989 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-16 20:02:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:56,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710720521] [2025-03-16 20:02:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710720521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:56,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:56,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544398843] [2025-03-16 20:02:56,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:56,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:56,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:56,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:56,993 INFO L87 Difference]: Start difference. First operand 15554 states and 26835 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:02:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:58,796 INFO L93 Difference]: Finished difference Result 47901 states and 84136 transitions. [2025-03-16 20:02:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:02:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:58,915 INFO L225 Difference]: With dead ends: 47901 [2025-03-16 20:02:58,916 INFO L226 Difference]: Without dead ends: 34485 [2025-03-16 20:02:58,950 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-16 20:02:58,951 INFO L435 NwaCegarLoop]: 4627 mSDtfsCounter, 5238 mSDsluCounter, 13927 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5269 SdHoareTripleChecker+Valid, 18554 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:58,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5269 Valid, 18554 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:02:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34485 states. [2025-03-16 20:03:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34485 to 31667. [2025-03-16 20:03:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31667 states, 29336 states have (on average 1.7016975729479138) internal successors, (49921), 30004 states have internal predecessors, (49921), 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-16 20:03:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31667 states to 31667 states and 56563 transitions. [2025-03-16 20:03:00,319 INFO L78 Accepts]: Start accepts. Automaton has 31667 states and 56563 transitions. Word has length 151 [2025-03-16 20:03:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:00,319 INFO L471 AbstractCegarLoop]: Abstraction has 31667 states and 56563 transitions. [2025-03-16 20:03:00,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 31667 states and 56563 transitions. [2025-03-16 20:03:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:03:00,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:00,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] [2025-03-16 20:03:00,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:03:00,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash 252155109, now seen corresponding path program 1 times [2025-03-16 20:03:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860480226] [2025-03-16 20:03:00,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:00,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:00,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:03:00,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:03:00,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:00,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:00,467 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-16 20:03:00,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:00,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860480226] [2025-03-16 20:03:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860480226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:00,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326341625] [2025-03-16 20:03:00,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:00,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:00,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:00,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:00,470 INFO L87 Difference]: Start difference. First operand 31667 states and 56563 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:02,264 INFO L93 Difference]: Finished difference Result 69968 states and 128716 transitions. [2025-03-16 20:03:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:02,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:03:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:02,524 INFO L225 Difference]: With dead ends: 69968 [2025-03-16 20:03:02,524 INFO L226 Difference]: Without dead ends: 40439 [2025-03-16 20:03:02,608 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-16 20:03:02,609 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 4662 mSDsluCounter, 8543 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4681 SdHoareTripleChecker+Valid, 12886 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:02,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4681 Valid, 12886 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:03:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40439 states. [2025-03-16 20:03:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40439 to 31667. [2025-03-16 20:03:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31667 states, 29336 states have (on average 1.6994818652849741) internal successors, (49856), 30004 states have internal predecessors, (49856), 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-16 20:03:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31667 states to 31667 states and 56498 transitions. [2025-03-16 20:03:04,063 INFO L78 Accepts]: Start accepts. Automaton has 31667 states and 56498 transitions. Word has length 151 [2025-03-16 20:03:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:04,064 INFO L471 AbstractCegarLoop]: Abstraction has 31667 states and 56498 transitions. [2025-03-16 20:03:04,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 31667 states and 56498 transitions. [2025-03-16 20:03:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:03:04,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:04,074 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] [2025-03-16 20:03:04,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:03:04,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:04,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1478400900, now seen corresponding path program 1 times [2025-03-16 20:03:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:04,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091469347] [2025-03-16 20:03:04,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:04,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:03:04,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:03:04,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:04,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:04,179 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-16 20:03:04,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:04,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091469347] [2025-03-16 20:03:04,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091469347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:04,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:04,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143315832] [2025-03-16 20:03:04,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:04,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:04,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:04,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:04,181 INFO L87 Difference]: Start difference. First operand 31667 states and 56498 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:06,523 INFO L93 Difference]: Finished difference Result 102854 states and 190527 transitions. [2025-03-16 20:03:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:03:06,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:03:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:06,856 INFO L225 Difference]: With dead ends: 102854 [2025-03-16 20:03:06,856 INFO L226 Difference]: Without dead ends: 73325 [2025-03-16 20:03:06,970 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-16 20:03:06,971 INFO L435 NwaCegarLoop]: 4619 mSDtfsCounter, 5171 mSDsluCounter, 13904 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5202 SdHoareTripleChecker+Valid, 18523 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:06,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5202 Valid, 18523 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:03:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73325 states. [2025-03-16 20:03:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73325 to 68657. [2025-03-16 20:03:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68657 states, 63364 states have (on average 1.7176630263240957) internal successors, (108838), 65426 states have internal predecessors, (108838), 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-16 20:03:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68657 states to 68657 states and 130136 transitions. [2025-03-16 20:03:10,301 INFO L78 Accepts]: Start accepts. Automaton has 68657 states and 130136 transitions. Word has length 151 [2025-03-16 20:03:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:10,302 INFO L471 AbstractCegarLoop]: Abstraction has 68657 states and 130136 transitions. [2025-03-16 20:03:10,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 68657 states and 130136 transitions. [2025-03-16 20:03:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:03:10,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:10,318 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] [2025-03-16 20:03:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:03:10,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:10,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1530084091, now seen corresponding path program 1 times [2025-03-16 20:03:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927962118] [2025-03-16 20:03:10,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:10,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:03:10,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:03:10,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:10,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:10,415 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-16 20:03:10,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:10,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927962118] [2025-03-16 20:03:10,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927962118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:10,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:10,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:10,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658075767] [2025-03-16 20:03:10,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:10,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:10,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:10,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:10,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:10,418 INFO L87 Difference]: Start difference. First operand 68657 states and 130136 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:13,613 INFO L93 Difference]: Finished difference Result 157066 states and 310140 transitions. [2025-03-16 20:03:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:13,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:03:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:14,052 INFO L225 Difference]: With dead ends: 157066 [2025-03-16 20:03:14,052 INFO L226 Difference]: Without dead ends: 90547 [2025-03-16 20:03:14,333 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-16 20:03:14,333 INFO L435 NwaCegarLoop]: 4338 mSDtfsCounter, 4658 mSDsluCounter, 8534 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4677 SdHoareTripleChecker+Valid, 12872 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:14,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4677 Valid, 12872 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:03:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90547 states. [2025-03-16 20:03:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90547 to 68657. [2025-03-16 20:03:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68657 states, 63364 states have (on average 1.715627170001894) internal successors, (108709), 65426 states have internal predecessors, (108709), 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-16 20:03:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68657 states to 68657 states and 130007 transitions. [2025-03-16 20:03:18,411 INFO L78 Accepts]: Start accepts. Automaton has 68657 states and 130007 transitions. Word has length 151 [2025-03-16 20:03:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:18,411 INFO L471 AbstractCegarLoop]: Abstraction has 68657 states and 130007 transitions. [2025-03-16 20:03:18,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 68657 states and 130007 transitions. [2025-03-16 20:03:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:03:18,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:18,427 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] [2025-03-16 20:03:18,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:03:18,427 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:18,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash 451077988, now seen corresponding path program 1 times [2025-03-16 20:03:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:18,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28973181] [2025-03-16 20:03:18,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:18,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:03:18,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:03:18,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:18,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:18,489 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-16 20:03:18,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:18,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28973181] [2025-03-16 20:03:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28973181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:18,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727741991] [2025-03-16 20:03:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:18,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:18,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:18,490 INFO L87 Difference]: Start difference. First operand 68657 states and 130007 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:21,968 INFO L93 Difference]: Finished difference Result 154877 states and 305504 transitions. [2025-03-16 20:03:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:21,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 20:03:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:22,317 INFO L225 Difference]: With dead ends: 154877 [2025-03-16 20:03:22,317 INFO L226 Difference]: Without dead ends: 88358 [2025-03-16 20:03:22,470 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-16 20:03:22,471 INFO L435 NwaCegarLoop]: 4335 mSDtfsCounter, 4655 mSDsluCounter, 8529 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4674 SdHoareTripleChecker+Valid, 12864 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:22,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4674 Valid, 12864 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:03:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88358 states. [2025-03-16 20:03:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88358 to 68657. [2025-03-16 20:03:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68657 states, 63364 states have (on average 1.7135913136796919) internal successors, (108580), 65426 states have internal predecessors, (108580), 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-16 20:03:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68657 states to 68657 states and 129878 transitions. [2025-03-16 20:03:26,903 INFO L78 Accepts]: Start accepts. Automaton has 68657 states and 129878 transitions. Word has length 151 [2025-03-16 20:03:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:26,904 INFO L471 AbstractCegarLoop]: Abstraction has 68657 states and 129878 transitions. [2025-03-16 20:03:26,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 20:03:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 68657 states and 129878 transitions. [2025-03-16 20:03:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 20:03:26,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:26,919 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] [2025-03-16 20:03:26,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:03:26,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:26,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash -731939547, now seen corresponding path program 1 times [2025-03-16 20:03:26,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:26,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152906906] [2025-03-16 20:03:26,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:26,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:26,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 20:03:26,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 20:03:26,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:26,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:26,990 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-16 20:03:26,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:26,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152906906] [2025-03-16 20:03:26,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152906906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:26,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032583651] [2025-03-16 20:03:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:26,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:26,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:26,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:26,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:26,993 INFO L87 Difference]: Start difference. First operand 68657 states and 129878 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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)