./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27587b975a36272f97d565edc796c457ff04a64b538fe9933b800d0dda8dcceb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:42:39,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:42:39,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:42:39,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:42:39,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:42:39,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:42:39,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:42:39,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:42:39,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:42:39,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:42:39,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:42:39,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:42:39,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:42:39,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:42:39,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:42:39,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:42:39,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:42:39,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:42:39,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:42:39,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:42:39,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:42:39,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:42:39,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:42:39,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:42:39,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:42:39,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:42:39,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:42:39,982 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:42:39,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:42:39,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:42:39,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:42:39,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:42:39,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:42:39,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:42:39,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:42:39,983 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 -> 27587b975a36272f97d565edc796c457ff04a64b538fe9933b800d0dda8dcceb [2025-03-03 15:42:40,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:42:40,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:42:40,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:42:40,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:42:40,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:42:40,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c [2025-03-03 15:42:41,308 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465577598/e97d83f2391249659d978a41c147395e/FLAG795edfe1e [2025-03-03 15:42:41,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:42:41,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c [2025-03-03 15:42:42,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465577598/e97d83f2391249659d978a41c147395e/FLAG795edfe1e [2025-03-03 15:42:42,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465577598/e97d83f2391249659d978a41c147395e [2025-03-03 15:42:42,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:42:42,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:42:42,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:42:42,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:42:42,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:42:42,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:42:42" (1/1) ... [2025-03-03 15:42:42,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd00f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:42, skipping insertion in model container [2025-03-03 15:42:42,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:42:42" (1/1) ... [2025-03-03 15:42:42,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:42:43,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c[380323,380336] [2025-03-03 15:42:43,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c[383339,383352] [2025-03-03 15:42:43,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:42:43,752 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:42:44,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c[380323,380336] [2025-03-03 15:42:44,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c[383339,383352] [2025-03-03 15:42:44,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:42:44,284 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:42:44,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44 WrapperNode [2025-03-03 15:42:44,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:42:44,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:42:44,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:42:44,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:42:44,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,679 INFO L138 Inliner]: procedures = 54, calls = 57, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 12792 [2025-03-03 15:42:44,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:42:44,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:42:44,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:42:44,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:42:44,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,784 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-03 15:42:44,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:44,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:45,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:42:45,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:42:45,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:42:45,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:42:45,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (1/1) ... [2025-03-03 15:42:45,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:42:45,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:45,072 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-03 15:42:45,078 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-03 15:42:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:42:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:42:45,093 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:42:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:42:45,093 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:42:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:42:45,093 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:42:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 15:42:45,093 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 15:42:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:42:45,093 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:42:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:42:45,093 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:42:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:42:45,094 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:42:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:42:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:42:45,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:42:45,189 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:42:45,190 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:42:50,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:42:50,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:42:50,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:42:50,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:42:50,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:42:50,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:42:50,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:42:51,009 INFO L? ?]: Removed 1717 outVars from TransFormulas that were not future-live. [2025-03-03 15:42:51,010 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:42:51,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:42:51,058 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:42:51,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:42:51 BoogieIcfgContainer [2025-03-03 15:42:51,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:42:51,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:42:51,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:42:51,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:42:51,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:42:42" (1/3) ... [2025-03-03 15:42:51,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb13bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:42:51, skipping insertion in model container [2025-03-03 15:42:51,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:44" (2/3) ... [2025-03-03 15:42:51,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb13bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:42:51, skipping insertion in model container [2025-03-03 15:42:51,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:42:51" (3/3) ... [2025-03-03 15:42:51,067 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.05.cil-2.c [2025-03-03 15:42:51,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:42:51,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.05.cil-2.c that has 8 procedures, 2410 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 15:42:51,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:42:51,248 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;@1b89c57f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:42:51,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:42:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 2410 states, 2379 states have (on average 1.844892812105927) internal successors, (4389), 2384 states have internal predecessors, (4389), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 15:42:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:51,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:51,282 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] [2025-03-03 15:42:51,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1787164735, now seen corresponding path program 1 times [2025-03-03 15:42:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:51,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920965189] [2025-03-03 15:42:51,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:51,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:51,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:51,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:51,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:51,794 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-03 15:42:51,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:51,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920965189] [2025-03-03 15:42:51,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920965189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:51,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:51,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786297806] [2025-03-03 15:42:51,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:51,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:51,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:51,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:51,825 INFO L87 Difference]: Start difference. First operand has 2410 states, 2379 states have (on average 1.844892812105927) internal successors, (4389), 2384 states have internal predecessors, (4389), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:52,328 INFO L93 Difference]: Finished difference Result 5037 states and 9207 transitions. [2025-03-03 15:42:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:42:52,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:52,352 INFO L225 Difference]: With dead ends: 5037 [2025-03-03 15:42:52,352 INFO L226 Difference]: Without dead ends: 2570 [2025-03-03 15:42:52,363 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-03 15:42:52,365 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4607 mSDsluCounter, 8718 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 13007 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:52,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 13007 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:42:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2025-03-03 15:42:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2553. [2025-03-03 15:42:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2503 states have (on average 1.8142229324810228) internal successors, (4541), 2507 states have internal predecessors, (4541), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:42:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4610 transitions. [2025-03-03 15:42:52,510 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4610 transitions. Word has length 102 [2025-03-03 15:42:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:52,510 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4610 transitions. [2025-03-03 15:42:52,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4610 transitions. [2025-03-03 15:42:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:52,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:52,515 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] [2025-03-03 15:42:52,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:42:52,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:52,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1665894975, now seen corresponding path program 1 times [2025-03-03 15:42:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:52,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608782773] [2025-03-03 15:42:52,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:52,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:52,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:52,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:52,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:52,731 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-03 15:42:52,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:52,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608782773] [2025-03-03 15:42:52,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608782773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:52,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285892880] [2025-03-03 15:42:52,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:52,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:52,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:52,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:52,735 INFO L87 Difference]: Start difference. First operand 2553 states and 4610 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:52,985 INFO L93 Difference]: Finished difference Result 3008 states and 5311 transitions. [2025-03-03 15:42:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:53,000 INFO L225 Difference]: With dead ends: 3008 [2025-03-03 15:42:53,000 INFO L226 Difference]: Without dead ends: 2589 [2025-03-03 15:42:53,004 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-03 15:42:53,005 INFO L435 NwaCegarLoop]: 4208 mSDtfsCounter, 4383 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4396 SdHoareTripleChecker+Valid, 12535 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:53,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4396 Valid, 12535 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:42:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2025-03-03 15:42:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2553. [2025-03-03 15:42:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2503 states have (on average 1.8134238913304035) internal successors, (4539), 2507 states have internal predecessors, (4539), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:42:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4608 transitions. [2025-03-03 15:42:53,077 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4608 transitions. Word has length 102 [2025-03-03 15:42:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:53,078 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4608 transitions. [2025-03-03 15:42:53,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4608 transitions. [2025-03-03 15:42:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:53,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:53,080 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] [2025-03-03 15:42:53,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:42:53,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:53,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash 456652736, now seen corresponding path program 1 times [2025-03-03 15:42:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325172452] [2025-03-03 15:42:53,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:53,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:53,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:53,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:53,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:53,223 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-03 15:42:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325172452] [2025-03-03 15:42:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325172452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:53,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906580821] [2025-03-03 15:42:53,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:53,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:53,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:53,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:53,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:53,224 INFO L87 Difference]: Start difference. First operand 2553 states and 4608 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:53,765 INFO L93 Difference]: Finished difference Result 3230 states and 5639 transitions. [2025-03-03 15:42:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:53,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:53,776 INFO L225 Difference]: With dead ends: 3230 [2025-03-03 15:42:53,777 INFO L226 Difference]: Without dead ends: 2811 [2025-03-03 15:42:53,779 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-03 15:42:53,780 INFO L435 NwaCegarLoop]: 4393 mSDtfsCounter, 4527 mSDsluCounter, 13184 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4540 SdHoareTripleChecker+Valid, 17577 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:53,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4540 Valid, 17577 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:42:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2025-03-03 15:42:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2750. [2025-03-03 15:42:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2679 states have (on average 1.7920865994774169) internal successors, (4801), 2684 states have internal predecessors, (4801), 49 states have call successors, (49), 19 states have call predecessors, (49), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-03 15:42:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 4901 transitions. [2025-03-03 15:42:53,845 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 4901 transitions. Word has length 102 [2025-03-03 15:42:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:53,845 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 4901 transitions. [2025-03-03 15:42:53,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 4901 transitions. [2025-03-03 15:42:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:53,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:53,846 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] [2025-03-03 15:42:53,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:42:53,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:53,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1664570911, now seen corresponding path program 1 times [2025-03-03 15:42:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986534342] [2025-03-03 15:42:53,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:53,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:53,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:53,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:53,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:53,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:53,975 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-03 15:42:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986534342] [2025-03-03 15:42:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986534342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:53,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:53,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:53,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053376639] [2025-03-03 15:42:53,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:53,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:53,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:53,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:53,978 INFO L87 Difference]: Start difference. First operand 2750 states and 4901 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:54,418 INFO L93 Difference]: Finished difference Result 3846 states and 6567 transitions. [2025-03-03 15:42:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:54,430 INFO L225 Difference]: With dead ends: 3846 [2025-03-03 15:42:54,430 INFO L226 Difference]: Without dead ends: 3230 [2025-03-03 15:42:54,432 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-03 15:42:54,432 INFO L435 NwaCegarLoop]: 4389 mSDtfsCounter, 4522 mSDsluCounter, 13172 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4535 SdHoareTripleChecker+Valid, 17561 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:54,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4535 Valid, 17561 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:42:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2025-03-03 15:42:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3163. [2025-03-03 15:42:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 3048 states have (on average 1.7572178477690288) internal successors, (5356), 3057 states have internal predecessors, (5356), 77 states have call successors, (77), 31 states have call predecessors, (77), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-03-03 15:42:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 5524 transitions. [2025-03-03 15:42:54,515 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 5524 transitions. Word has length 102 [2025-03-03 15:42:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:54,516 INFO L471 AbstractCegarLoop]: Abstraction has 3163 states and 5524 transitions. [2025-03-03 15:42:54,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 5524 transitions. [2025-03-03 15:42:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:54,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:54,518 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] [2025-03-03 15:42:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:42:54,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:54,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash 179515360, now seen corresponding path program 1 times [2025-03-03 15:42:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955924375] [2025-03-03 15:42:54,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:54,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:54,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:54,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:54,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:54,614 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-03 15:42:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955924375] [2025-03-03 15:42:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955924375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535145157] [2025-03-03 15:42:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:54,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:54,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:54,616 INFO L87 Difference]: Start difference. First operand 3163 states and 5524 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:55,156 INFO L93 Difference]: Finished difference Result 5149 states and 8568 transitions. [2025-03-03 15:42:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:55,175 INFO L225 Difference]: With dead ends: 5149 [2025-03-03 15:42:55,175 INFO L226 Difference]: Without dead ends: 4120 [2025-03-03 15:42:55,180 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-03 15:42:55,181 INFO L435 NwaCegarLoop]: 4386 mSDtfsCounter, 4517 mSDsluCounter, 13163 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4530 SdHoareTripleChecker+Valid, 17549 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:55,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4530 Valid, 17549 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:42:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2025-03-03 15:42:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4040. [2025-03-03 15:42:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4040 states, 3831 states have (on average 1.7092143043591752) internal successors, (6548), 3854 states have internal predecessors, (6548), 133 states have call successors, (133), 55 states have call predecessors, (133), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-03-03 15:42:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4040 states to 4040 states and 6876 transitions. [2025-03-03 15:42:55,322 INFO L78 Accepts]: Start accepts. Automaton has 4040 states and 6876 transitions. Word has length 102 [2025-03-03 15:42:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:55,323 INFO L471 AbstractCegarLoop]: Abstraction has 4040 states and 6876 transitions. [2025-03-03 15:42:55,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4040 states and 6876 transitions. [2025-03-03 15:42:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:55,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:55,326 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] [2025-03-03 15:42:55,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:42:55,327 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:55,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash 962894335, now seen corresponding path program 1 times [2025-03-03 15:42:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:55,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693276526] [2025-03-03 15:42:55,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:55,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:55,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:55,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:55,426 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-03 15:42:55,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:55,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693276526] [2025-03-03 15:42:55,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693276526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:55,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:55,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:55,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791111763] [2025-03-03 15:42:55,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:55,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:55,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:55,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:55,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:55,428 INFO L87 Difference]: Start difference. First operand 4040 states and 6876 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:55,962 INFO L93 Difference]: Finished difference Result 8222 states and 13387 transitions. [2025-03-03 15:42:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:55,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:55,987 INFO L225 Difference]: With dead ends: 8222 [2025-03-03 15:42:55,987 INFO L226 Difference]: Without dead ends: 6316 [2025-03-03 15:42:55,994 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-03 15:42:55,995 INFO L435 NwaCegarLoop]: 4377 mSDtfsCounter, 4673 mSDsluCounter, 13133 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 17510 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:55,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 17510 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:42:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2025-03-03 15:42:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 5878. [2025-03-03 15:42:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5878 states, 5471 states have (on average 1.6585633339426065) internal successors, (9074), 5540 states have internal predecessors, (9074), 237 states have call successors, (237), 103 states have call predecessors, (237), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:42:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 9802 transitions. [2025-03-03 15:42:56,224 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 9802 transitions. Word has length 102 [2025-03-03 15:42:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:56,224 INFO L471 AbstractCegarLoop]: Abstraction has 5878 states and 9802 transitions. [2025-03-03 15:42:56,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 9802 transitions. [2025-03-03 15:42:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:56,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:56,227 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] [2025-03-03 15:42:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:42:56,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:56,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:56,227 INFO L85 PathProgramCache]: Analyzing trace with hash 391643102, now seen corresponding path program 1 times [2025-03-03 15:42:56,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871899714] [2025-03-03 15:42:56,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:56,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:56,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:56,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:56,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:56,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:56,288 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-03 15:42:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871899714] [2025-03-03 15:42:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871899714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:56,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586918505] [2025-03-03 15:42:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:56,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:56,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:56,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:56,290 INFO L87 Difference]: Start difference. First operand 5878 states and 9802 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:56,575 INFO L93 Difference]: Finished difference Result 10120 states and 16664 transitions. [2025-03-03 15:42:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:56,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:56,607 INFO L225 Difference]: With dead ends: 10120 [2025-03-03 15:42:56,608 INFO L226 Difference]: Without dead ends: 6376 [2025-03-03 15:42:56,619 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-03 15:42:56,620 INFO L435 NwaCegarLoop]: 4195 mSDtfsCounter, 4373 mSDsluCounter, 8300 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4386 SdHoareTripleChecker+Valid, 12495 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:56,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4386 Valid, 12495 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:42:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6376 states. [2025-03-03 15:42:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6376 to 5878. [2025-03-03 15:42:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5878 states, 5471 states have (on average 1.655456040943155) internal successors, (9057), 5540 states have internal predecessors, (9057), 237 states have call successors, (237), 103 states have call predecessors, (237), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:42:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 9785 transitions. [2025-03-03 15:42:56,809 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 9785 transitions. Word has length 102 [2025-03-03 15:42:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:56,810 INFO L471 AbstractCegarLoop]: Abstraction has 5878 states and 9785 transitions. [2025-03-03 15:42:56,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 9785 transitions. [2025-03-03 15:42:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:56,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:56,815 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] [2025-03-03 15:42:56,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:42:56,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:56,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:56,816 INFO L85 PathProgramCache]: Analyzing trace with hash 511762975, now seen corresponding path program 1 times [2025-03-03 15:42:56,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:56,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859254067] [2025-03-03 15:42:56,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:56,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:56,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:56,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:56,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:56,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:56,947 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-03 15:42:56,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859254067] [2025-03-03 15:42:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859254067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:56,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:56,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:56,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471157607] [2025-03-03 15:42:56,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:56,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:56,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:56,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:56,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:56,950 INFO L87 Difference]: Start difference. First operand 5878 states and 9785 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:57,568 INFO L93 Difference]: Finished difference Result 14066 states and 22948 transitions. [2025-03-03 15:42:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:57,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:57,612 INFO L225 Difference]: With dead ends: 14066 [2025-03-03 15:42:57,612 INFO L226 Difference]: Without dead ends: 10322 [2025-03-03 15:42:57,629 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-03 15:42:57,630 INFO L435 NwaCegarLoop]: 4369 mSDtfsCounter, 4600 mSDsluCounter, 13110 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4619 SdHoareTripleChecker+Valid, 17479 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:57,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4619 Valid, 17479 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:42:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10322 states. [2025-03-03 15:42:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10322 to 9746. [2025-03-03 15:42:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9746 states, 8897 states have (on average 1.6116668539957288) internal successors, (14339), 9112 states have internal predecessors, (14339), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:42:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 16235 transitions. [2025-03-03 15:42:58,221 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 16235 transitions. Word has length 102 [2025-03-03 15:42:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:58,221 INFO L471 AbstractCegarLoop]: Abstraction has 9746 states and 16235 transitions. [2025-03-03 15:42:58,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 16235 transitions. [2025-03-03 15:42:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:58,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:58,235 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] [2025-03-03 15:42:58,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:42:58,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 931279806, now seen corresponding path program 1 times [2025-03-03 15:42:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:58,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500200316] [2025-03-03 15:42:58,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:58,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:58,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:58,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:58,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:58,382 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-03 15:42:58,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:58,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500200316] [2025-03-03 15:42:58,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500200316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:58,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:58,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:58,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439805100] [2025-03-03 15:42:58,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:58,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:58,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:58,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:58,385 INFO L87 Difference]: Start difference. First operand 9746 states and 16235 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:58,841 INFO L93 Difference]: Finished difference Result 18338 states and 30808 transitions. [2025-03-03 15:42:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:58,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:58,873 INFO L225 Difference]: With dead ends: 18338 [2025-03-03 15:42:58,874 INFO L226 Difference]: Without dead ends: 10726 [2025-03-03 15:42:58,894 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-03 15:42:58,894 INFO L435 NwaCegarLoop]: 4190 mSDtfsCounter, 4369 mSDsluCounter, 8291 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4382 SdHoareTripleChecker+Valid, 12481 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:58,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4382 Valid, 12481 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:42:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10726 states. [2025-03-03 15:42:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10726 to 9746. [2025-03-03 15:42:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9746 states, 8897 states have (on average 1.6079577385635608) internal successors, (14306), 9112 states have internal predecessors, (14306), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:42:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 16202 transitions. [2025-03-03 15:42:59,359 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 16202 transitions. Word has length 102 [2025-03-03 15:42:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:59,359 INFO L471 AbstractCegarLoop]: Abstraction has 9746 states and 16202 transitions. [2025-03-03 15:42:59,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 16202 transitions. [2025-03-03 15:42:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:42:59,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:59,365 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] [2025-03-03 15:42:59,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:42:59,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 944812607, now seen corresponding path program 1 times [2025-03-03 15:42:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636108689] [2025-03-03 15:42:59,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:59,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:59,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:42:59,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:42:59,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:59,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:59,445 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-03 15:42:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636108689] [2025-03-03 15:42:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636108689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:59,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753478514] [2025-03-03 15:42:59,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:59,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:59,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:59,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:59,446 INFO L87 Difference]: Start difference. First operand 9746 states and 16202 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:59,968 INFO L93 Difference]: Finished difference Result 18093 states and 30252 transitions. [2025-03-03 15:42:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:59,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:42:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:00,005 INFO L225 Difference]: With dead ends: 18093 [2025-03-03 15:43:00,005 INFO L226 Difference]: Without dead ends: 10481 [2025-03-03 15:43:00,025 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-03 15:43:00,026 INFO L435 NwaCegarLoop]: 4187 mSDtfsCounter, 4366 mSDsluCounter, 8286 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4379 SdHoareTripleChecker+Valid, 12473 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:00,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4379 Valid, 12473 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:43:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10481 states. [2025-03-03 15:43:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10481 to 9746. [2025-03-03 15:43:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9746 states, 8897 states have (on average 1.6042486231313926) internal successors, (14273), 9112 states have internal predecessors, (14273), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:43:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 16169 transitions. [2025-03-03 15:43:00,407 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 16169 transitions. Word has length 102 [2025-03-03 15:43:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:00,408 INFO L471 AbstractCegarLoop]: Abstraction has 9746 states and 16169 transitions. [2025-03-03 15:43:00,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 16169 transitions. [2025-03-03 15:43:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:43:00,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:00,413 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] [2025-03-03 15:43:00,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:43:00,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2053627806, now seen corresponding path program 1 times [2025-03-03 15:43:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456384824] [2025-03-03 15:43:00,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:00,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:43:00,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:43:00,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:00,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:00,510 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-03 15:43:00,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:00,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456384824] [2025-03-03 15:43:00,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456384824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:00,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:00,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780944146] [2025-03-03 15:43:00,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:00,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:00,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:00,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:00,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:00,512 INFO L87 Difference]: Start difference. First operand 9746 states and 16169 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:01,349 INFO L93 Difference]: Finished difference Result 25470 states and 42902 transitions. [2025-03-03 15:43:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:01,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:43:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:01,407 INFO L225 Difference]: With dead ends: 25470 [2025-03-03 15:43:01,407 INFO L226 Difference]: Without dead ends: 17858 [2025-03-03 15:43:01,430 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-03 15:43:01,430 INFO L435 NwaCegarLoop]: 4356 mSDtfsCounter, 4489 mSDsluCounter, 13073 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 17429 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:01,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 17429 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:43:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17858 states. [2025-03-03 15:43:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17858 to 17515. [2025-03-03 15:43:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17515 states, 15636 states have (on average 1.5605653619851625) internal successors, (24401), 16305 states have internal predecessors, (24401), 821 states have call successors, (821), 391 states have call predecessors, (821), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-03-03 15:43:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17515 states to 17515 states and 30137 transitions. [2025-03-03 15:43:02,348 INFO L78 Accepts]: Start accepts. Automaton has 17515 states and 30137 transitions. Word has length 102 [2025-03-03 15:43:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:02,349 INFO L471 AbstractCegarLoop]: Abstraction has 17515 states and 30137 transitions. [2025-03-03 15:43:02,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 17515 states and 30137 transitions. [2025-03-03 15:43:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:43:02,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:02,357 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] [2025-03-03 15:43:02,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:43:02,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:02,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1374287265, now seen corresponding path program 1 times [2025-03-03 15:43:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:02,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540726968] [2025-03-03 15:43:02,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:02,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:43:02,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:43:02,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:02,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:02,416 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-03 15:43:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540726968] [2025-03-03 15:43:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540726968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:02,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:02,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:43:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873595056] [2025-03-03 15:43:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:02,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:43:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:02,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:43:02,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:43:02,418 INFO L87 Difference]: Start difference. First operand 17515 states and 30137 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:03,882 INFO L93 Difference]: Finished difference Result 47620 states and 82062 transitions. [2025-03-03 15:43:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-03 15:43:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:03,969 INFO L225 Difference]: With dead ends: 47620 [2025-03-03 15:43:03,969 INFO L226 Difference]: Without dead ends: 32240 [2025-03-03 15:43:04,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:43:04,007 INFO L435 NwaCegarLoop]: 4558 mSDtfsCounter, 4511 mSDsluCounter, 4485 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 9043 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:04,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 9043 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:43:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32240 states. [2025-03-03 15:43:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32240 to 32175. [2025-03-03 15:43:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32175 states, 28425 states have (on average 1.5221108179419525) internal successors, (43266), 29825 states have internal predecessors, (43266), 1636 states have call successors, (1636), 781 states have call predecessors, (1636), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-03-03 15:43:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32175 states to 32175 states and 54665 transitions. [2025-03-03 15:43:05,426 INFO L78 Accepts]: Start accepts. Automaton has 32175 states and 54665 transitions. Word has length 102 [2025-03-03 15:43:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:05,426 INFO L471 AbstractCegarLoop]: Abstraction has 32175 states and 54665 transitions. [2025-03-03 15:43:05,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 32175 states and 54665 transitions. [2025-03-03 15:43:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:43:05,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:05,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:43:05,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:43:05,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:05,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:05,481 INFO L85 PathProgramCache]: Analyzing trace with hash -792772746, now seen corresponding path program 1 times [2025-03-03 15:43:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895761816] [2025-03-03 15:43:05,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:05,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:43:05,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:43:05,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:05,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:43:05,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:05,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895761816] [2025-03-03 15:43:05,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895761816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:05,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156115306] [2025-03-03 15:43:05,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:05,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:05,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:05,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:43:05,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:43:05,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:43:05,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:43:05,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:05,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:05,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:43:05,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:43:05,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156115306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:05,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:05,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:43:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264721094] [2025-03-03 15:43:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:05,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:05,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:05,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:05,759 INFO L87 Difference]: Start difference. First operand 32175 states and 54665 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:43:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:08,595 INFO L93 Difference]: Finished difference Result 91604 states and 155779 transitions. [2025-03-03 15:43:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 167 [2025-03-03 15:43:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:08,827 INFO L225 Difference]: With dead ends: 91604 [2025-03-03 15:43:08,827 INFO L226 Difference]: Without dead ends: 61564 [2025-03-03 15:43:08,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:08,893 INFO L435 NwaCegarLoop]: 4281 mSDtfsCounter, 4231 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4231 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:08,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4231 Valid, 4576 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61564 states. [2025-03-03 15:43:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61564 to 61170. [2025-03-03 15:43:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61170 states, 53808 states have (on average 1.5101100208147487) internal successors, (81256), 56605 states have internal predecessors, (81256), 3136 states have call successors, (3136), 1561 states have call predecessors, (3136), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-03-03 15:43:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61170 states to 61170 states and 103721 transitions. [2025-03-03 15:43:11,887 INFO L78 Accepts]: Start accepts. Automaton has 61170 states and 103721 transitions. Word has length 167 [2025-03-03 15:43:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:11,887 INFO L471 AbstractCegarLoop]: Abstraction has 61170 states and 103721 transitions. [2025-03-03 15:43:11,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:43:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 61170 states and 103721 transitions. [2025-03-03 15:43:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:43:11,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:11,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:43:11,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:43:12,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 15:43:12,170 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:12,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash -992143492, now seen corresponding path program 1 times [2025-03-03 15:43:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:12,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105677334] [2025-03-03 15:43:12,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:12,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:43:12,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:43:12,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:12,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:43:12,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:12,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105677334] [2025-03-03 15:43:12,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105677334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:12,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381617273] [2025-03-03 15:43:12,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:12,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:12,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:12,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:43:12,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:43:12,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:43:12,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:43:12,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:12,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:12,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:43:12,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:43:12,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:12,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381617273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:12,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:12,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:43:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715542237] [2025-03-03 15:43:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:12,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:12,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:12,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:12,465 INFO L87 Difference]: Start difference. First operand 61170 states and 103721 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:43:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:17,317 INFO L93 Difference]: Finished difference Result 177939 states and 302627 transitions. [2025-03-03 15:43:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 167 [2025-03-03 15:43:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:17,919 INFO L225 Difference]: With dead ends: 177939 [2025-03-03 15:43:17,920 INFO L226 Difference]: Without dead ends: 118904 [2025-03-03 15:43:18,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:18,032 INFO L435 NwaCegarLoop]: 4281 mSDtfsCounter, 4225 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:18,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 4576 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118904 states.