./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-1.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_label46+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23a748a14ab5667159adb09776d3545981eaa20034460211a51a13329e4251e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:03:50,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:03:50,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:03:50,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:03:50,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:03:50,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:03:50,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:03:50,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:03:50,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:03:50,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:03:50,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:03:50,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:03:50,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:03:50,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:03:50,863 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:03:50,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:03:50,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:03:50,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:03:50,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:03:50,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:03:50,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:03:50,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:03:50,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:03:50,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:03:50,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:03:50,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:03:50,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:03:50,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:03:50,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:03:50,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:03:50,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:03:50,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:03:50,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:03:50,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:03:50,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:03:50,868 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 -> 23a748a14ab5667159adb09776d3545981eaa20034460211a51a13329e4251e4 [2025-03-16 20:03:51,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:03:51,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:03:51,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:03:51,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:03:51,086 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:03:51,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-1.c [2025-03-16 20:03:52,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95f89536/36683dcf00b245fc90d50ebc184accc0/FLAG4cbf1ea17 [2025-03-16 20:03:52,925 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:03:52,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-1.c [2025-03-16 20:03:52,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95f89536/36683dcf00b245fc90d50ebc184accc0/FLAG4cbf1ea17 [2025-03-16 20:03:53,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95f89536/36683dcf00b245fc90d50ebc184accc0 [2025-03-16 20:03:53,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:03:53,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:03:53,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:03:53,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:03:53,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:03:53,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:03:53" (1/1) ... [2025-03-16 20:03:53,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa7c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:53, skipping insertion in model container [2025-03-16 20:03:53,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:03:53" (1/1) ... [2025-03-16 20:03:53,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:03:54,568 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_label46+token_ring.07.cil-1.c[382357,382370] [2025-03-16 20:03:54,592 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_label46+token_ring.07.cil-1.c[383339,383352] [2025-03-16 20:03:54,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:03:54,784 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:03:55,289 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_label46+token_ring.07.cil-1.c[382357,382370] [2025-03-16 20:03:55,292 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_label46+token_ring.07.cil-1.c[383339,383352] [2025-03-16 20:03:55,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:03:55,337 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:03:55,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55 WrapperNode [2025-03-16 20:03:55,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:03:55,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:03:55,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:03:55,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:03:55,343 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:03:55" (1/1) ... [2025-03-16 20:03:55,409 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:03:55" (1/1) ... [2025-03-16 20:03:55,687 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-03-16 20:03:55,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:03:55,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:03:55,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:03:55,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:03:55,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:55,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:55,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:55,860 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:03:55,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:55,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:55,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:56,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:56,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:56,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:56,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:03:56,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:03:56,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:03:56,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:03:56,096 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (1/1) ... [2025-03-16 20:03:56,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:03:56,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:56,121 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:03:56,128 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:03:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:03:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:03:56,145 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:03:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:03:56,145 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:03:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:03:56,146 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:03:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:03:56,146 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:03:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:03:56,146 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:03:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:03:56,146 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:03:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:03:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:03:56,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:03:56,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:03:56,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:04:02,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:04:02,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:04:02,299 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:04:02,299 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:04:02,299 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:04:02,299 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:04:02,299 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:04:02,573 INFO L? ?]: Removed 1715 outVars from TransFormulas that were not future-live. [2025-03-16 20:04:02,573 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:04:02,613 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:04:02,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:04:02,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:02 BoogieIcfgContainer [2025-03-16 20:04:02,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:04:02,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:04:02,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:04:02,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:04:02,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:03:53" (1/3) ... [2025-03-16 20:04:02,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792d2b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:02, skipping insertion in model container [2025-03-16 20:04:02,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:55" (2/3) ... [2025-03-16 20:04:02,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792d2b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:02, skipping insertion in model container [2025-03-16 20:04:02,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:02" (3/3) ... [2025-03-16 20:04:02,625 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.07.cil-1.c [2025-03-16 20:04:02,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:04:02,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.07.cil-1.c that has 7 procedures, 2364 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-16 20:04:02,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:04:02,754 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;@1fbdaf76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:04:02,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:04:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 2364 states, 2335 states have (on average 1.871948608137045) internal successors, (4371), 2337 states have internal predecessors, (4371), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 20:04:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:02,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:02,780 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] [2025-03-16 20:04:02,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:02,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:02,785 INFO L85 PathProgramCache]: Analyzing trace with hash 160491844, now seen corresponding path program 1 times [2025-03-16 20:04:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:02,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735331071] [2025-03-16 20:04:02,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:02,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:02,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:02,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:02,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:03,270 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:04:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:03,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735331071] [2025-03-16 20:04:03,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735331071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709545776] [2025-03-16 20:04:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:03,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:03,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:03,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:03,299 INFO L87 Difference]: Start difference. First operand has 2364 states, 2335 states have (on average 1.871948608137045) internal successors, (4371), 2337 states have internal predecessors, (4371), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:03,683 INFO L93 Difference]: Finished difference Result 4730 states and 8834 transitions. [2025-03-16 20:04:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:03,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:03,703 INFO L225 Difference]: With dead ends: 4730 [2025-03-16 20:04:03,703 INFO L226 Difference]: Without dead ends: 2375 [2025-03-16 20:04:03,715 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:04:03,717 INFO L435 NwaCegarLoop]: 4249 mSDtfsCounter, 4462 mSDsluCounter, 8393 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 12642 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:03,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 12642 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2025-03-16 20:04:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2359. [2025-03-16 20:04:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2330 states have (on average 1.8416309012875536) internal successors, (4291), 2332 states have internal predecessors, (4291), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 20:04:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4333 transitions. [2025-03-16 20:04:03,853 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4333 transitions. Word has length 111 [2025-03-16 20:04:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:03,854 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 4333 transitions. [2025-03-16 20:04:03,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4333 transitions. [2025-03-16 20:04:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:03,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:03,858 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] [2025-03-16 20:04:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:04:03,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash -648995613, now seen corresponding path program 1 times [2025-03-16 20:04:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721719044] [2025-03-16 20:04:03,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:03,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:03,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:03,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:03,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:04,172 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:04:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721719044] [2025-03-16 20:04:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721719044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801226421] [2025-03-16 20:04:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:04,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:04,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:04,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:04,175 INFO L87 Difference]: Start difference. First operand 2359 states and 4333 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:04,729 INFO L93 Difference]: Finished difference Result 2854 states and 5130 transitions. [2025-03-16 20:04:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:04,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:04,741 INFO L225 Difference]: With dead ends: 2854 [2025-03-16 20:04:04,741 INFO L226 Difference]: Without dead ends: 2629 [2025-03-16 20:04:04,743 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:04:04,743 INFO L435 NwaCegarLoop]: 4452 mSDtfsCounter, 4649 mSDsluCounter, 13447 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4664 SdHoareTripleChecker+Valid, 17899 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:04,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4664 Valid, 17899 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:04:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2025-03-16 20:04:04,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2597. [2025-03-16 20:04:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2542 states have (on average 1.8214004720692367) internal successors, (4630), 2546 states have internal predecessors, (4630), 39 states have call successors, (39), 12 states have call predecessors, (39), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-03-16 20:04:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4715 transitions. [2025-03-16 20:04:04,796 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4715 transitions. Word has length 111 [2025-03-16 20:04:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:04,797 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 4715 transitions. [2025-03-16 20:04:04,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4715 transitions. [2025-03-16 20:04:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:04,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:04,800 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] [2025-03-16 20:04:04,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:04:04,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:04,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1090750108, now seen corresponding path program 1 times [2025-03-16 20:04:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982292382] [2025-03-16 20:04:04,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:04,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:04,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:04,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:04,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:04,943 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:04:04,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:04,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982292382] [2025-03-16 20:04:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982292382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:04,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:04,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714980346] [2025-03-16 20:04:04,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:04,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:04,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:04,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:04,945 INFO L87 Difference]: Start difference. First operand 2597 states and 4715 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:05,434 INFO L93 Difference]: Finished difference Result 3564 states and 6271 transitions. [2025-03-16 20:04:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:05,448 INFO L225 Difference]: With dead ends: 3564 [2025-03-16 20:04:05,448 INFO L226 Difference]: Without dead ends: 3103 [2025-03-16 20:04:05,451 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:04:05,453 INFO L435 NwaCegarLoop]: 4415 mSDtfsCounter, 4645 mSDsluCounter, 13369 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4660 SdHoareTripleChecker+Valid, 17784 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:05,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4660 Valid, 17784 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:04:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2025-03-16 20:04:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3059. [2025-03-16 20:04:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 2956 states have (on average 1.7892422192151556) internal successors, (5289), 2964 states have internal predecessors, (5289), 71 states have call successors, (71), 24 states have call predecessors, (71), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-03-16 20:04:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5454 transitions. [2025-03-16 20:04:05,541 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5454 transitions. Word has length 111 [2025-03-16 20:04:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:05,541 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 5454 transitions. [2025-03-16 20:04:05,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5454 transitions. [2025-03-16 20:04:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:05,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:05,545 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] [2025-03-16 20:04:05,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:04:05,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:05,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1105000253, now seen corresponding path program 1 times [2025-03-16 20:04:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:05,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644647195] [2025-03-16 20:04:05,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:05,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:05,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:05,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:05,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:05,760 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:04:05,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:05,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644647195] [2025-03-16 20:04:05,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644647195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:05,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:05,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:05,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628498108] [2025-03-16 20:04:05,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:05,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:05,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:05,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:05,762 INFO L87 Difference]: Start difference. First operand 3059 states and 5454 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:06,311 INFO L93 Difference]: Finished difference Result 5047 states and 8688 transitions. [2025-03-16 20:04:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:06,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:06,327 INFO L225 Difference]: With dead ends: 5047 [2025-03-16 20:04:06,328 INFO L226 Difference]: Without dead ends: 4124 [2025-03-16 20:04:06,332 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:04:06,332 INFO L435 NwaCegarLoop]: 4412 mSDtfsCounter, 4640 mSDsluCounter, 13356 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 17768 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:06,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 17768 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:04:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4124 states. [2025-03-16 20:04:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4124 to 4057. [2025-03-16 20:04:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4057 states, 3852 states have (on average 1.7484423676012462) internal successors, (6735), 3874 states have internal predecessors, (6735), 135 states have call successors, (135), 48 states have call predecessors, (135), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-03-16 20:04:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 4057 states and 7084 transitions. [2025-03-16 20:04:06,459 INFO L78 Accepts]: Start accepts. Automaton has 4057 states and 7084 transitions. Word has length 111 [2025-03-16 20:04:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:06,459 INFO L471 AbstractCegarLoop]: Abstraction has 4057 states and 7084 transitions. [2025-03-16 20:04:06,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4057 states and 7084 transitions. [2025-03-16 20:04:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:06,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:06,466 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] [2025-03-16 20:04:06,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:04:06,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:06,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2075291260, now seen corresponding path program 1 times [2025-03-16 20:04:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:06,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549639742] [2025-03-16 20:04:06,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:06,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:06,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:06,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:06,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:06,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:06,586 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:04:06,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:06,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549639742] [2025-03-16 20:04:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549639742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:06,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670894549] [2025-03-16 20:04:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:06,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:06,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:06,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:06,588 INFO L87 Difference]: Start difference. First operand 4057 states and 7084 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:07,122 INFO L93 Difference]: Finished difference Result 8290 states and 14118 transitions. [2025-03-16 20:04:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:07,153 INFO L225 Difference]: With dead ends: 8290 [2025-03-16 20:04:07,153 INFO L226 Difference]: Without dead ends: 6369 [2025-03-16 20:04:07,163 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:04:07,165 INFO L435 NwaCegarLoop]: 4411 mSDtfsCounter, 4635 mSDsluCounter, 13345 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4650 SdHoareTripleChecker+Valid, 17756 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:07,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4650 Valid, 17756 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:04:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2025-03-16 20:04:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 6259. [2025-03-16 20:04:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6259 states, 5832 states have (on average 1.7114197530864197) internal successors, (9981), 5900 states have internal predecessors, (9981), 263 states have call successors, (263), 96 states have call predecessors, (263), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-03-16 20:04:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6259 states to 6259 states and 10794 transitions. [2025-03-16 20:04:07,468 INFO L78 Accepts]: Start accepts. Automaton has 6259 states and 10794 transitions. Word has length 111 [2025-03-16 20:04:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:07,468 INFO L471 AbstractCegarLoop]: Abstraction has 6259 states and 10794 transitions. [2025-03-16 20:04:07,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6259 states and 10794 transitions. [2025-03-16 20:04:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:07,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:07,473 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] [2025-03-16 20:04:07,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:04:07,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:07,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:07,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1136759645, now seen corresponding path program 1 times [2025-03-16 20:04:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706466617] [2025-03-16 20:04:07,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:07,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:07,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:07,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:07,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:07,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706466617] [2025-03-16 20:04:07,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706466617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:07,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:07,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093179031] [2025-03-16 20:04:07,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:07,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:07,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:07,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:07,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:07,591 INFO L87 Difference]: Start difference. First operand 6259 states and 10794 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:08,326 INFO L93 Difference]: Finished difference Result 15541 states and 26760 transitions. [2025-03-16 20:04:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:08,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:08,380 INFO L225 Difference]: With dead ends: 15541 [2025-03-16 20:04:08,380 INFO L226 Difference]: Without dead ends: 11418 [2025-03-16 20:04:08,392 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:04:08,393 INFO L435 NwaCegarLoop]: 4408 mSDtfsCounter, 4630 mSDsluCounter, 13332 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 17740 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:08,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 17740 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:04:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11418 states. [2025-03-16 20:04:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11418 to 11229. [2025-03-16 20:04:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11229 states, 10304 states have (on average 1.6920613354037266) internal successors, (17435), 10518 states have internal predecessors, (17435), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 20:04:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11229 states to 11229 states and 19560 transitions. [2025-03-16 20:04:08,733 INFO L78 Accepts]: Start accepts. Automaton has 11229 states and 19560 transitions. Word has length 111 [2025-03-16 20:04:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:08,733 INFO L471 AbstractCegarLoop]: Abstraction has 11229 states and 19560 transitions. [2025-03-16 20:04:08,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 11229 states and 19560 transitions. [2025-03-16 20:04:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:08,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:08,740 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] [2025-03-16 20:04:08,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:04:08,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:08,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1522126428, now seen corresponding path program 1 times [2025-03-16 20:04:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:08,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792435327] [2025-03-16 20:04:08,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:08,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:08,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:08,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:08,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:08,814 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:04:08,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:08,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792435327] [2025-03-16 20:04:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792435327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:08,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:08,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:08,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183472615] [2025-03-16 20:04:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:08,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:08,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:08,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:08,816 INFO L87 Difference]: Start difference. First operand 11229 states and 19560 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:09,535 INFO L93 Difference]: Finished difference Result 22754 states and 40423 transitions. [2025-03-16 20:04:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:09,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:09,589 INFO L225 Difference]: With dead ends: 22754 [2025-03-16 20:04:09,590 INFO L226 Difference]: Without dead ends: 13659 [2025-03-16 20:04:09,623 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:04:09,623 INFO L435 NwaCegarLoop]: 4230 mSDtfsCounter, 4448 mSDsluCounter, 8356 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4463 SdHoareTripleChecker+Valid, 12586 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:09,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4463 Valid, 12586 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13659 states. [2025-03-16 20:04:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13659 to 11229. [2025-03-16 20:04:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11229 states, 10304 states have (on average 1.6888586956521738) internal successors, (17402), 10518 states have internal predecessors, (17402), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 20:04:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11229 states to 11229 states and 19527 transitions. [2025-03-16 20:04:10,116 INFO L78 Accepts]: Start accepts. Automaton has 11229 states and 19527 transitions. Word has length 111 [2025-03-16 20:04:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:10,117 INFO L471 AbstractCegarLoop]: Abstraction has 11229 states and 19527 transitions. [2025-03-16 20:04:10,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 11229 states and 19527 transitions. [2025-03-16 20:04:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:10,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:10,124 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] [2025-03-16 20:04:10,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:04:10,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:10,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:10,125 INFO L85 PathProgramCache]: Analyzing trace with hash 128010371, now seen corresponding path program 1 times [2025-03-16 20:04:10,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:10,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055452332] [2025-03-16 20:04:10,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:10,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:10,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:10,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:10,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:10,200 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:04:10,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:10,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055452332] [2025-03-16 20:04:10,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055452332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:10,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811957215] [2025-03-16 20:04:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:10,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:10,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:10,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:10,202 INFO L87 Difference]: Start difference. First operand 11229 states and 19527 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:10,824 INFO L93 Difference]: Finished difference Result 22268 states and 39385 transitions. [2025-03-16 20:04:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:10,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:10,876 INFO L225 Difference]: With dead ends: 22268 [2025-03-16 20:04:10,876 INFO L226 Difference]: Without dead ends: 13173 [2025-03-16 20:04:10,906 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:04:10,907 INFO L435 NwaCegarLoop]: 4225 mSDtfsCounter, 4442 mSDsluCounter, 8345 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4457 SdHoareTripleChecker+Valid, 12570 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:10,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4457 Valid, 12570 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13173 states. [2025-03-16 20:04:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13173 to 11229. [2025-03-16 20:04:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11229 states, 10304 states have (on average 1.685656055900621) internal successors, (17369), 10518 states have internal predecessors, (17369), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 20:04:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11229 states to 11229 states and 19494 transitions. [2025-03-16 20:04:11,570 INFO L78 Accepts]: Start accepts. Automaton has 11229 states and 19494 transitions. Word has length 111 [2025-03-16 20:04:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:11,571 INFO L471 AbstractCegarLoop]: Abstraction has 11229 states and 19494 transitions. [2025-03-16 20:04:11,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 11229 states and 19494 transitions. [2025-03-16 20:04:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:11,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:11,578 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] [2025-03-16 20:04:11,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:04:11,579 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:11,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1296206626, now seen corresponding path program 1 times [2025-03-16 20:04:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693048100] [2025-03-16 20:04:11,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:11,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:11,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:11,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:11,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:11,691 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:04:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693048100] [2025-03-16 20:04:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693048100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:11,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399460675] [2025-03-16 20:04:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:11,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:11,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:11,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:11,692 INFO L87 Difference]: Start difference. First operand 11229 states and 19494 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:12,536 INFO L93 Difference]: Finished difference Result 32395 states and 57417 transitions. [2025-03-16 20:04:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:12,625 INFO L225 Difference]: With dead ends: 32395 [2025-03-16 20:04:12,626 INFO L226 Difference]: Without dead ends: 23302 [2025-03-16 20:04:12,656 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:04:12,659 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 4753 mSDsluCounter, 13260 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4776 SdHoareTripleChecker+Valid, 17652 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:12,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4776 Valid, 17652 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:04:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23302 states. [2025-03-16 20:04:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23302 to 21885. [2025-03-16 20:04:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21885 states, 19834 states have (on average 1.6774730261167692) internal successors, (33271), 20502 states have internal predecessors, (33271), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 20:04:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21885 states to 21885 states and 39492 transitions. [2025-03-16 20:04:13,442 INFO L78 Accepts]: Start accepts. Automaton has 21885 states and 39492 transitions. Word has length 111 [2025-03-16 20:04:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:13,442 INFO L471 AbstractCegarLoop]: Abstraction has 21885 states and 39492 transitions. [2025-03-16 20:04:13,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 21885 states and 39492 transitions. [2025-03-16 20:04:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:13,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:13,453 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] [2025-03-16 20:04:13,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:04:13,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash 86964387, now seen corresponding path program 1 times [2025-03-16 20:04:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599216428] [2025-03-16 20:04:13,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:13,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:13,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:13,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:13,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:13,544 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:04:13,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:13,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599216428] [2025-03-16 20:04:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599216428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:13,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965483696] [2025-03-16 20:04:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:13,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:13,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:13,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:13,546 INFO L87 Difference]: Start difference. First operand 21885 states and 39492 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:14,404 INFO L93 Difference]: Finished difference Result 46010 states and 85917 transitions. [2025-03-16 20:04:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:14,588 INFO L225 Difference]: With dead ends: 46010 [2025-03-16 20:04:14,589 INFO L226 Difference]: Without dead ends: 26259 [2025-03-16 20:04:14,631 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:04:14,632 INFO L435 NwaCegarLoop]: 4220 mSDtfsCounter, 4438 mSDsluCounter, 8336 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 12556 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:14,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 12556 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26259 states. [2025-03-16 20:04:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26259 to 21885. [2025-03-16 20:04:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21885 states, 19834 states have (on average 1.6741958253504083) internal successors, (33206), 20502 states have internal predecessors, (33206), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 20:04:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21885 states to 21885 states and 39427 transitions. [2025-03-16 20:04:16,107 INFO L78 Accepts]: Start accepts. Automaton has 21885 states and 39427 transitions. Word has length 111 [2025-03-16 20:04:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:16,107 INFO L471 AbstractCegarLoop]: Abstraction has 21885 states and 39427 transitions. [2025-03-16 20:04:16,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 21885 states and 39427 transitions. [2025-03-16 20:04:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:16,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:16,117 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] [2025-03-16 20:04:16,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:04:16,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:16,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1294882562, now seen corresponding path program 1 times [2025-03-16 20:04:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:16,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726532768] [2025-03-16 20:04:16,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:16,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:16,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:16,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:16,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:16,183 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:04:16,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:16,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726532768] [2025-03-16 20:04:16,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726532768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:16,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:16,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229298996] [2025-03-16 20:04:16,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:16,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:16,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:16,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:16,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:16,185 INFO L87 Difference]: Start difference. First operand 21885 states and 39427 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:17,099 INFO L93 Difference]: Finished difference Result 45281 states and 84329 transitions. [2025-03-16 20:04:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:17,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:17,206 INFO L225 Difference]: With dead ends: 45281 [2025-03-16 20:04:17,206 INFO L226 Difference]: Without dead ends: 25530 [2025-03-16 20:04:17,258 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:04:17,259 INFO L435 NwaCegarLoop]: 4217 mSDtfsCounter, 4435 mSDsluCounter, 8331 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 12548 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:17,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 12548 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25530 states. [2025-03-16 20:04:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25530 to 21885. [2025-03-16 20:04:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21885 states, 19834 states have (on average 1.6709186245840475) internal successors, (33141), 20502 states have internal predecessors, (33141), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 20:04:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21885 states to 21885 states and 39362 transitions. [2025-03-16 20:04:18,392 INFO L78 Accepts]: Start accepts. Automaton has 21885 states and 39362 transitions. Word has length 111 [2025-03-16 20:04:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:18,393 INFO L471 AbstractCegarLoop]: Abstraction has 21885 states and 39362 transitions. [2025-03-16 20:04:18,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21885 states and 39362 transitions. [2025-03-16 20:04:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:18,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:18,402 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] [2025-03-16 20:04:18,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:04:18,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:18,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash -190172989, now seen corresponding path program 1 times [2025-03-16 20:04:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716204627] [2025-03-16 20:04:18,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:18,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:18,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:18,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:18,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:18,486 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:04:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716204627] [2025-03-16 20:04:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716204627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507723815] [2025-03-16 20:04:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:18,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:18,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:18,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:18,489 INFO L87 Difference]: Start difference. First operand 21885 states and 39362 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:20,343 INFO L93 Difference]: Finished difference Result 65538 states and 124219 transitions. [2025-03-16 20:04:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:20,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:20,547 INFO L225 Difference]: With dead ends: 65538 [2025-03-16 20:04:20,547 INFO L226 Difference]: Without dead ends: 45789 [2025-03-16 20:04:20,610 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:04:20,611 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4651 mSDsluCounter, 13210 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4674 SdHoareTripleChecker+Valid, 17590 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:20,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4674 Valid, 17590 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45789 states. [2025-03-16 20:04:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45789 to 44311. [2025-03-16 20:04:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44311 states, 39554 states have (on average 1.6605905850230065) internal successors, (65683), 41616 states have internal predecessors, (65683), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-16 20:04:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44311 states to 44311 states and 86176 transitions. [2025-03-16 20:04:23,528 INFO L78 Accepts]: Start accepts. Automaton has 44311 states and 86176 transitions. Word has length 111 [2025-03-16 20:04:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:23,529 INFO L471 AbstractCegarLoop]: Abstraction has 44311 states and 86176 transitions. [2025-03-16 20:04:23,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 44311 states and 86176 transitions. [2025-03-16 20:04:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:23,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:23,545 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] [2025-03-16 20:04:23,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:04:23,545 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:23,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 593205986, now seen corresponding path program 1 times [2025-03-16 20:04:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490203325] [2025-03-16 20:04:23,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:23,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:23,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:23,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:23,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:23,618 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:04:23,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490203325] [2025-03-16 20:04:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490203325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193153064] [2025-03-16 20:04:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:23,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:23,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:23,620 INFO L87 Difference]: Start difference. First operand 44311 states and 86176 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:26,334 INFO L93 Difference]: Finished difference Result 93049 states and 191829 transitions. [2025-03-16 20:04:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:26,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:26,595 INFO L225 Difference]: With dead ends: 93049 [2025-03-16 20:04:26,595 INFO L226 Difference]: Without dead ends: 50872 [2025-03-16 20:04:26,722 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:04:26,722 INFO L435 NwaCegarLoop]: 4212 mSDtfsCounter, 4431 mSDsluCounter, 8322 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 12534 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:26,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 12534 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50872 states. [2025-03-16 20:04:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50872 to 44311. [2025-03-16 20:04:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44311 states, 39554 states have (on average 1.6573292208120545) internal successors, (65554), 41616 states have internal predecessors, (65554), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-16 20:04:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44311 states to 44311 states and 86047 transitions. [2025-03-16 20:04:31,401 INFO L78 Accepts]: Start accepts. Automaton has 44311 states and 86047 transitions. Word has length 111 [2025-03-16 20:04:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:31,401 INFO L471 AbstractCegarLoop]: Abstraction has 44311 states and 86047 transitions. [2025-03-16 20:04:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:04:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 44311 states and 86047 transitions. [2025-03-16 20:04:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:04:31,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:31,417 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] [2025-03-16 20:04:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:04:31,418 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 64286947, now seen corresponding path program 1 times [2025-03-16 20:04:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602776899] [2025-03-16 20:04:31,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:31,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:04:31,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:04:31,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:31,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:31,497 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:04:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602776899] [2025-03-16 20:04:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602776899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404898478] [2025-03-16 20:04:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:31,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:31,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:31,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:31,500 INFO L87 Difference]: Start difference. First operand 44311 states and 86047 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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:04:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:35,980 INFO L93 Difference]: Finished difference Result 133756 states and 286837 transitions. [2025-03-16 20:04:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:04:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:36,531 INFO L225 Difference]: With dead ends: 133756 [2025-03-16 20:04:36,531 INFO L226 Difference]: Without dead ends: 91581 [2025-03-16 20:04:36,693 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:04:36,694 INFO L435 NwaCegarLoop]: 4373 mSDtfsCounter, 4584 mSDsluCounter, 13179 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4607 SdHoareTripleChecker+Valid, 17552 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:36,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4607 Valid, 17552 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91581 states.