./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 212f1e6cc1aae5a1223162e16d5bd8071b486da78643961fa0a66e81c45b8eae --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:27:28,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:27:28,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:27:28,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:27:28,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:27:28,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:27:28,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:27:28,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:27:28,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:27:28,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:27:28,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:27:28,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:27:28,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:27:28,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:27:28,286 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:27:28,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:27:28,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:27:28,286 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:27:28,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:27:28,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:27:28,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:27:28,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:27:28,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:27:28,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:27:28,287 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:27:28,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:27:28,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:27:28,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:27:28,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:27:28,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:27:28,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:27:28,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:27:28,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:28,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:27:28,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:27:28,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:28,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:27:28,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:27:28,289 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-jdk21/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 -> 212f1e6cc1aae5a1223162e16d5bd8071b486da78643961fa0a66e81c45b8eae [2025-01-09 05:27:28,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:27:28,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:27:28,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:27:28,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:27:28,643 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:27:28,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c [2025-01-09 05:27:30,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/154761db7/d717e0c52d444ae0a6a72c186a6291b9/FLAG20bd738ac [2025-01-09 05:27:30,692 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:27:30,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c [2025-01-09 05:27:30,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/154761db7/d717e0c52d444ae0a6a72c186a6291b9/FLAG20bd738ac [2025-01-09 05:27:30,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/154761db7/d717e0c52d444ae0a6a72c186a6291b9 [2025-01-09 05:27:30,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:27:30,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:27:30,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:27:30,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:27:30,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:27:30,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:27:30" (1/1) ... [2025-01-09 05:27:30,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e143ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:30, skipping insertion in model container [2025-01-09 05:27:30,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:27:30" (1/1) ... [2025-01-09 05:27:30,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:27:32,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c[380593,380606] [2025-01-09 05:27:32,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c[383339,383352] [2025-01-09 05:27:32,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:27:32,715 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:27:33,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c[380593,380606] [2025-01-09 05:27:33,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c[383339,383352] [2025-01-09 05:27:33,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:27:33,563 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:27:33,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33 WrapperNode [2025-01-09 05:27:33,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:27:33,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:27:33,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:27:33,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:27:33,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:33,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,089 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-01-09 05:27:34,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:27:34,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:27:34,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:27:34,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:27:34,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,252 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-01-09 05:27:34,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:27:34,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:27:34,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:27:34,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:27:34,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (1/1) ... [2025-01-09 05:27:34,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:34,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:27:34,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:27:34,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:27:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:27:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:27:34,969 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:27:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:27:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:27:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:27:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:27:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:27:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:27:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:27:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:27:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:27:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:27:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:27:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:27:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:27:35,101 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:27:35,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:27:43,587 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2025-01-09 05:27:43,587 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:27:43,659 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:27:43,659 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-09 05:27:43,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:27:43 BoogieIcfgContainer [2025-01-09 05:27:43,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:27:43,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:27:43,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:27:43,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:27:43,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:27:30" (1/3) ... [2025-01-09 05:27:43,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fc1079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:27:43, skipping insertion in model container [2025-01-09 05:27:43,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:33" (2/3) ... [2025-01-09 05:27:43,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fc1079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:27:43, skipping insertion in model container [2025-01-09 05:27:43,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:27:43" (3/3) ... [2025-01-09 05:27:43,670 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.07.cil-1.c [2025-01-09 05:27:43,685 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:27:43,688 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.07.cil-1.c that has 7 procedures, 2438 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-01-09 05:27:43,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:27:43,827 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;@3b603bf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:27:43,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:27:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 05:27:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:43,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:43,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:43,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:43,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1615448220, now seen corresponding path program 1 times [2025-01-09 05:27:43,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:43,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096675004] [2025-01-09 05:27:43,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:43,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:43,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:43,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:43,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:43,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096675004] [2025-01-09 05:27:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096675004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:44,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:27:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702879046] [2025-01-09 05:27:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:44,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:27:44,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:44,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:27:44,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:27:44,287 INFO L87 Difference]: Start difference. First operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:44,490 INFO L93 Difference]: Finished difference Result 4871 states and 8965 transitions. [2025-01-09 05:27:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:27:44,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:44,526 INFO L225 Difference]: With dead ends: 4871 [2025-01-09 05:27:44,526 INFO L226 Difference]: Without dead ends: 2371 [2025-01-09 05:27:44,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:27:44,541 INFO L435 NwaCegarLoop]: 4413 mSDtfsCounter, 387 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 8435 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:44,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 8435 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:27:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2025-01-09 05:27:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2371. [2025-01-09 05:27:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2342 states have (on average 1.8373185311699403) internal successors, (4303), 2344 states have internal predecessors, (4303), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 05:27:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 4345 transitions. [2025-01-09 05:27:44,709 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 4345 transitions. Word has length 121 [2025-01-09 05:27:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:44,712 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 4345 transitions. [2025-01-09 05:27:44,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 4345 transitions. [2025-01-09 05:27:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:44,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:44,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:44,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:27:44,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash -111696742, now seen corresponding path program 1 times [2025-01-09 05:27:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:44,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573546677] [2025-01-09 05:27:44,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:44,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:44,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:44,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:44,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:45,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:45,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573546677] [2025-01-09 05:27:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573546677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:45,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:45,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:27:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100838048] [2025-01-09 05:27:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:45,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:27:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:45,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:27:45,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:27:45,053 INFO L87 Difference]: Start difference. First operand 2371 states and 4345 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:45,693 INFO L93 Difference]: Finished difference Result 2869 states and 5129 transitions. [2025-01-09 05:27:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:27:45,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:45,710 INFO L225 Difference]: With dead ends: 2869 [2025-01-09 05:27:45,710 INFO L226 Difference]: Without dead ends: 2634 [2025-01-09 05:27:45,712 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-01-09 05:27:45,714 INFO L435 NwaCegarLoop]: 4257 mSDtfsCounter, 4681 mSDsluCounter, 8668 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4696 SdHoareTripleChecker+Valid, 12925 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:45,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4696 Valid, 12925 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:27:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-01-09 05:27:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2615. [2025-01-09 05:27:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2563 states have (on average 1.815060476004682) internal successors, (4652), 2566 states have internal predecessors, (4652), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2025-01-09 05:27:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 4727 transitions. [2025-01-09 05:27:45,787 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 4727 transitions. Word has length 121 [2025-01-09 05:27:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:45,788 INFO L471 AbstractCegarLoop]: Abstraction has 2615 states and 4727 transitions. [2025-01-09 05:27:45,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 4727 transitions. [2025-01-09 05:27:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:45,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:45,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:45,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:27:45,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:45,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2077489950, now seen corresponding path program 1 times [2025-01-09 05:27:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:45,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489266397] [2025-01-09 05:27:45,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:45,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:45,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:45,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:45,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489266397] [2025-01-09 05:27:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489266397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:45,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88615343] [2025-01-09 05:27:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:45,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:45,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:45,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:45,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:45,999 INFO L87 Difference]: Start difference. First operand 2615 states and 4727 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:46,730 INFO L93 Difference]: Finished difference Result 3404 states and 5978 transitions. [2025-01-09 05:27:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:46,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:46,748 INFO L225 Difference]: With dead ends: 3404 [2025-01-09 05:27:46,748 INFO L226 Difference]: Without dead ends: 2925 [2025-01-09 05:27:46,751 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-01-09 05:27:46,754 INFO L435 NwaCegarLoop]: 4457 mSDtfsCounter, 4681 mSDsluCounter, 13380 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4696 SdHoareTripleChecker+Valid, 17837 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:46,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4696 Valid, 17837 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:27:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2025-01-09 05:27:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2842. [2025-01-09 05:27:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2842 states, 2767 states have (on average 1.795084929526563) internal successors, (4967), 2771 states have internal predecessors, (4967), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (57), 54 states have call predecessors, (57), 53 states have call successors, (57) [2025-01-09 05:27:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 5077 transitions. [2025-01-09 05:27:46,846 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 5077 transitions. Word has length 121 [2025-01-09 05:27:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:46,846 INFO L471 AbstractCegarLoop]: Abstraction has 2842 states and 5077 transitions. [2025-01-09 05:27:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 5077 transitions. [2025-01-09 05:27:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:46,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:46,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:46,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:27:46,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:46,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 210781276, now seen corresponding path program 1 times [2025-01-09 05:27:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723818205] [2025-01-09 05:27:46,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:46,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:46,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:46,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:47,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723818205] [2025-01-09 05:27:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723818205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:47,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:47,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774854927] [2025-01-09 05:27:47,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:47,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:47,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:47,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:47,046 INFO L87 Difference]: Start difference. First operand 2842 states and 5077 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:48,202 INFO L93 Difference]: Finished difference Result 4125 states and 7107 transitions. [2025-01-09 05:27:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:48,221 INFO L225 Difference]: With dead ends: 4125 [2025-01-09 05:27:48,222 INFO L226 Difference]: Without dead ends: 3419 [2025-01-09 05:27:48,226 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-01-09 05:27:48,226 INFO L435 NwaCegarLoop]: 4453 mSDtfsCounter, 4676 mSDsluCounter, 13368 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4691 SdHoareTripleChecker+Valid, 17821 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:48,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4691 Valid, 17821 Invalid, 779 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:27:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2025-01-09 05:27:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3325. [2025-01-09 05:27:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 3202 states have (on average 1.7638975640224859) internal successors, (5648), 3210 states have internal predecessors, (5648), 85 states have call successors, (85), 30 states have call predecessors, (85), 36 states have return successors, (101), 88 states have call predecessors, (101), 85 states have call successors, (101) [2025-01-09 05:27:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 5834 transitions. [2025-01-09 05:27:48,376 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 5834 transitions. Word has length 121 [2025-01-09 05:27:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:48,377 INFO L471 AbstractCegarLoop]: Abstraction has 3325 states and 5834 transitions. [2025-01-09 05:27:48,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 5834 transitions. [2025-01-09 05:27:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:48,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:48,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:48,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:27:48,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:48,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1096361122, now seen corresponding path program 1 times [2025-01-09 05:27:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:48,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306517882] [2025-01-09 05:27:48,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:48,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:48,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306517882] [2025-01-09 05:27:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306517882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173561924] [2025-01-09 05:27:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:48,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:48,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:48,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:48,578 INFO L87 Difference]: Start difference. First operand 3325 states and 5834 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:49,356 INFO L93 Difference]: Finished difference Result 5678 states and 9590 transitions. [2025-01-09 05:27:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:49,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:49,383 INFO L225 Difference]: With dead ends: 5678 [2025-01-09 05:27:49,383 INFO L226 Difference]: Without dead ends: 4489 [2025-01-09 05:27:49,389 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-01-09 05:27:49,391 INFO L435 NwaCegarLoop]: 4450 mSDtfsCounter, 4671 mSDsluCounter, 13359 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4686 SdHoareTripleChecker+Valid, 17809 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:49,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4686 Valid, 17809 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:27:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2025-01-09 05:27:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4372. [2025-01-09 05:27:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 4147 states have (on average 1.7246202073788282) internal successors, (7152), 4169 states have internal predecessors, (7152), 149 states have call successors, (149), 54 states have call predecessors, (149), 74 states have return successors, (213), 156 states have call predecessors, (213), 149 states have call successors, (213) [2025-01-09 05:27:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 7514 transitions. [2025-01-09 05:27:49,564 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 7514 transitions. Word has length 121 [2025-01-09 05:27:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:49,565 INFO L471 AbstractCegarLoop]: Abstraction has 4372 states and 7514 transitions. [2025-01-09 05:27:49,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 7514 transitions. [2025-01-09 05:27:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:49,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:49,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:49,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:27:49,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:49,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 801135644, now seen corresponding path program 1 times [2025-01-09 05:27:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307115404] [2025-01-09 05:27:49,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:49,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:49,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:49,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:49,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:49,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307115404] [2025-01-09 05:27:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307115404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:49,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44895468] [2025-01-09 05:27:49,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:49,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:49,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:49,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:49,768 INFO L87 Difference]: Start difference. First operand 4372 states and 7514 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:50,508 INFO L93 Difference]: Finished difference Result 9089 states and 15208 transitions. [2025-01-09 05:27:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:50,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:50,550 INFO L225 Difference]: With dead ends: 9089 [2025-01-09 05:27:50,550 INFO L226 Difference]: Without dead ends: 6853 [2025-01-09 05:27:50,560 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-01-09 05:27:50,561 INFO L435 NwaCegarLoop]: 4447 mSDtfsCounter, 4666 mSDsluCounter, 13350 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4681 SdHoareTripleChecker+Valid, 17797 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:50,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4681 Valid, 17797 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:27:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6853 states. [2025-01-09 05:27:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6853 to 6691. [2025-01-09 05:27:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6691 states, 6244 states have (on average 1.6899423446508648) internal successors, (10552), 6312 states have internal predecessors, (10552), 277 states have call successors, (277), 102 states have call predecessors, (277), 168 states have return successors, (533), 292 states have call predecessors, (533), 277 states have call successors, (533) [2025-01-09 05:27:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6691 states to 6691 states and 11362 transitions. [2025-01-09 05:27:50,849 INFO L78 Accepts]: Start accepts. Automaton has 6691 states and 11362 transitions. Word has length 121 [2025-01-09 05:27:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:50,850 INFO L471 AbstractCegarLoop]: Abstraction has 6691 states and 11362 transitions. [2025-01-09 05:27:50,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6691 states and 11362 transitions. [2025-01-09 05:27:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:50,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:50,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:50,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:27:50,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:50,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1832176542, now seen corresponding path program 1 times [2025-01-09 05:27:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795739292] [2025-01-09 05:27:50,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:50,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:50,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:50,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:50,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:50,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:50,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795739292] [2025-01-09 05:27:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795739292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:50,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:50,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:50,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615717713] [2025-01-09 05:27:50,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:50,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:50,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:51,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:51,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:51,000 INFO L87 Difference]: Start difference. First operand 6691 states and 11362 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:51,931 INFO L93 Difference]: Finished difference Result 16752 states and 28378 transitions. [2025-01-09 05:27:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:51,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:52,005 INFO L225 Difference]: With dead ends: 16752 [2025-01-09 05:27:52,006 INFO L226 Difference]: Without dead ends: 12197 [2025-01-09 05:27:52,026 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-01-09 05:27:52,027 INFO L435 NwaCegarLoop]: 4444 mSDtfsCounter, 4661 mSDsluCounter, 13341 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4676 SdHoareTripleChecker+Valid, 17785 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:52,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4676 Valid, 17785 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:27:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12197 states. [2025-01-09 05:27:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12197 to 11950. [2025-01-09 05:27:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11950 states, 11005 states have (on average 1.674148114493412) internal successors, (18424), 11219 states have internal predecessors, (18424), 533 states have call successors, (533), 198 states have call predecessors, (533), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 05:27:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11950 states to 11950 states and 20514 transitions. [2025-01-09 05:27:52,732 INFO L78 Accepts]: Start accepts. Automaton has 11950 states and 20514 transitions. Word has length 121 [2025-01-09 05:27:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:52,733 INFO L471 AbstractCegarLoop]: Abstraction has 11950 states and 20514 transitions. [2025-01-09 05:27:52,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 11950 states and 20514 transitions. [2025-01-09 05:27:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:52,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:52,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:52,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:27:52,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:52,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -74226724, now seen corresponding path program 1 times [2025-01-09 05:27:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:52,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931808221] [2025-01-09 05:27:52,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:52,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:52,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:52,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:52,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:52,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931808221] [2025-01-09 05:27:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931808221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:52,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:27:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683993214] [2025-01-09 05:27:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:52,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:27:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:52,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:27:52,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:27:52,977 INFO L87 Difference]: Start difference. First operand 11950 states and 20514 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:53,774 INFO L93 Difference]: Finished difference Result 24214 states and 42303 transitions. [2025-01-09 05:27:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:27:53,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:53,849 INFO L225 Difference]: With dead ends: 24214 [2025-01-09 05:27:53,850 INFO L226 Difference]: Without dead ends: 14400 [2025-01-09 05:27:53,889 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-01-09 05:27:53,890 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 4467 mSDsluCounter, 8363 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 12597 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:53,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 12597 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:27:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14400 states. [2025-01-09 05:27:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14400 to 11950. [2025-01-09 05:27:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11950 states, 11005 states have (on average 1.6711494775102227) internal successors, (18391), 11219 states have internal predecessors, (18391), 533 states have call successors, (533), 198 states have call predecessors, (533), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 05:27:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11950 states to 11950 states and 20481 transitions. [2025-01-09 05:27:54,538 INFO L78 Accepts]: Start accepts. Automaton has 11950 states and 20481 transitions. Word has length 121 [2025-01-09 05:27:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:54,539 INFO L471 AbstractCegarLoop]: Abstraction has 11950 states and 20481 transitions. [2025-01-09 05:27:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11950 states and 20481 transitions. [2025-01-09 05:27:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:54,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:54,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:54,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:27:54,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:54,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1130957926, now seen corresponding path program 1 times [2025-01-09 05:27:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:54,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438693701] [2025-01-09 05:27:54,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:54,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:54,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:54,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:54,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:54,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438693701] [2025-01-09 05:27:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438693701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:54,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379900093] [2025-01-09 05:27:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:54,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:54,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:54,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:54,682 INFO L87 Difference]: Start difference. First operand 11950 states and 20481 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:56,601 INFO L93 Difference]: Finished difference Result 35559 states and 61998 transitions. [2025-01-09 05:27:56,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:56,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:27:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:56,724 INFO L225 Difference]: With dead ends: 35559 [2025-01-09 05:27:56,724 INFO L226 Difference]: Without dead ends: 25745 [2025-01-09 05:27:56,758 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-01-09 05:27:56,759 INFO L435 NwaCegarLoop]: 4430 mSDtfsCounter, 4869 mSDsluCounter, 13297 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4892 SdHoareTripleChecker+Valid, 17727 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:56,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4892 Valid, 17727 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:27:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25745 states. [2025-01-09 05:27:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25745 to 23587. [2025-01-09 05:27:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23587 states, 21516 states have (on average 1.6716397099832683) internal successors, (35967), 22184 states have internal predecessors, (35967), 1013 states have call successors, (1013), 390 states have call predecessors, (1013), 1056 states have return successors, (5109), 1076 states have call predecessors, (5109), 1013 states have call successors, (5109) [2025-01-09 05:27:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23587 states to 23587 states and 42089 transitions. [2025-01-09 05:27:57,760 INFO L78 Accepts]: Start accepts. Automaton has 23587 states and 42089 transitions. Word has length 121 [2025-01-09 05:27:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:57,760 INFO L471 AbstractCegarLoop]: Abstraction has 23587 states and 42089 transitions. [2025-01-09 05:27:57,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23587 states and 42089 transitions. [2025-01-09 05:27:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:27:57,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:57,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:57,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:27:57,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:57,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash 220427292, now seen corresponding path program 1 times [2025-01-09 05:27:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:57,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998520901] [2025-01-09 05:27:57,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:57,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:27:57,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:27:57,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:57,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:58,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:58,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998520901] [2025-01-09 05:27:58,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998520901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:58,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:58,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740497170] [2025-01-09 05:27:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:58,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:58,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:58,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:58,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:58,074 INFO L87 Difference]: Start difference. First operand 23587 states and 42089 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:00,721 INFO L93 Difference]: Finished difference Result 75552 states and 141096 transitions. [2025-01-09 05:28:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:00,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:28:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:01,076 INFO L225 Difference]: With dead ends: 75552 [2025-01-09 05:28:01,076 INFO L226 Difference]: Without dead ends: 54101 [2025-01-09 05:28:01,174 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-01-09 05:28:01,175 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4702 mSDsluCounter, 13285 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4716 SdHoareTripleChecker+Valid, 17711 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:01,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4716 Valid, 17711 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:28:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54101 states. [2025-01-09 05:28:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54101 to 50154. [2025-01-09 05:28:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50154 states, 45377 states have (on average 1.6838266081935782) internal successors, (76407), 47439 states have internal predecessors, (76407), 1941 states have call successors, (1941), 774 states have call predecessors, (1941), 2834 states have return successors, (18325), 2068 states have call predecessors, (18325), 1941 states have call successors, (18325) [2025-01-09 05:28:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50154 states to 50154 states and 96673 transitions. [2025-01-09 05:28:04,473 INFO L78 Accepts]: Start accepts. Automaton has 50154 states and 96673 transitions. Word has length 121 [2025-01-09 05:28:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:04,477 INFO L471 AbstractCegarLoop]: Abstraction has 50154 states and 96673 transitions. [2025-01-09 05:28:04,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 50154 states and 96673 transitions. [2025-01-09 05:28:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:28:04,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:04,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:28:04,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:04,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1398547622, now seen corresponding path program 1 times [2025-01-09 05:28:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898159937] [2025-01-09 05:28:04,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:04,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:28:04,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:28:04,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:04,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:28:04,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898159937] [2025-01-09 05:28:04,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898159937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:04,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:04,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951684183] [2025-01-09 05:28:04,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:04,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:04,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:04,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:04,685 INFO L87 Difference]: Start difference. First operand 50154 states and 96673 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:09,197 INFO L93 Difference]: Finished difference Result 167287 states and 347998 transitions. [2025-01-09 05:28:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 05:28:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:10,027 INFO L225 Difference]: With dead ends: 167287 [2025-01-09 05:28:10,027 INFO L226 Difference]: Without dead ends: 119269 [2025-01-09 05:28:10,207 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-01-09 05:28:10,208 INFO L435 NwaCegarLoop]: 4424 mSDtfsCounter, 4799 mSDsluCounter, 13279 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4822 SdHoareTripleChecker+Valid, 17703 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:10,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4822 Valid, 17703 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:28:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119269 states. [2025-01-09 05:28:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119269 to 112829. [2025-01-09 05:28:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112829 states, 101246 states have (on average 1.7000474092803666) internal successors, (172123), 107554 states have internal predecessors, (172123), 3733 states have call successors, (3733), 1542 states have call predecessors, (3733), 7848 states have return successors, (69269), 3988 states have call predecessors, (69269), 3733 states have call successors, (69269) [2025-01-09 05:28:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112829 states to 112829 states and 245125 transitions. [2025-01-09 05:28:19,021 INFO L78 Accepts]: Start accepts. Automaton has 112829 states and 245125 transitions. Word has length 121 [2025-01-09 05:28:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:19,021 INFO L471 AbstractCegarLoop]: Abstraction has 112829 states and 245125 transitions. [2025-01-09 05:28:19,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 112829 states and 245125 transitions. [2025-01-09 05:28:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:28:19,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:19,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:28:19,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:19,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2012910684, now seen corresponding path program 1 times [2025-01-09 05:28:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:19,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051104212] [2025-01-09 05:28:19,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:19,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:19,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:28:19,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:28:19,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:19,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:28:19,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:19,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051104212] [2025-01-09 05:28:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051104212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:19,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169986355] [2025-01-09 05:28:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:19,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:19,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:19,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:19,235 INFO L87 Difference]: Start difference. First operand 112829 states and 245125 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)