./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.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_label45+token_ring.09.cil-2.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 b445a4f49d9151eb44c8190083d36f280681906d4dfab457d725a1f68c1551d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:21:47,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:21:47,900 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:21:47,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:21:47,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:21:47,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:21:47,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:21:47,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:21:47,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:21:47,946 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:21:47,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:21:47,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:21:47,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:21:47,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:21:47,946 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:21:47,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:21:47,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:21:47,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:47,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:47,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:21:47,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:21:47,948 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 -> b445a4f49d9151eb44c8190083d36f280681906d4dfab457d725a1f68c1551d8 [2025-01-09 05:21:48,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:21:48,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:21:48,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:21:48,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:21:48,187 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:21:48,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c [2025-01-09 05:21:49,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e614927a/3b3915302b8643e09438c73ee92a797f/FLAG4bceb9780 [2025-01-09 05:21:50,006 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:21:50,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c [2025-01-09 05:21:50,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e614927a/3b3915302b8643e09438c73ee92a797f/FLAG4bceb9780 [2025-01-09 05:21:50,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e614927a/3b3915302b8643e09438c73ee92a797f [2025-01-09 05:21:50,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:21:50,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:21:50,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:21:50,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:21:50,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:21:50,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:50" (1/1) ... [2025-01-09 05:21:50,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:50, skipping insertion in model container [2025-01-09 05:21:50,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:50" (1/1) ... [2025-01-09 05:21:50,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:21:51,798 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_label45+token_ring.09.cil-2.c[380323,380336] [2025-01-09 05:21:51,825 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_label45+token_ring.09.cil-2.c[383339,383352] [2025-01-09 05:21:52,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:21:52,053 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:21:52,587 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_label45+token_ring.09.cil-2.c[380323,380336] [2025-01-09 05:21:52,591 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_label45+token_ring.09.cil-2.c[383339,383352] [2025-01-09 05:21:52,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:21:52,659 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:21:52,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52 WrapperNode [2025-01-09 05:21:52,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:21:52,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:21:52,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:21:52,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:21:52,666 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:21:52" (1/1) ... [2025-01-09 05:21:52,742 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:21:52" (1/1) ... [2025-01-09 05:21:53,013 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13020 [2025-01-09 05:21:53,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:21:53,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:21:53,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:21:53,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:21:53,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,158 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:21:53,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:21:53,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:21:53,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:21:53,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:21:53,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (1/1) ... [2025-01-09 05:21:53,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:53,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:21:53,589 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:21:53,594 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:21:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:21:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:21:53,613 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:21:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:21:53,613 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:21:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:21:53,613 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:21:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:21:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:21:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:21:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:21:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:21:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:21:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:21:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:21:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:21:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:21:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:21:53,714 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:21:53,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:22:00,151 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2025-01-09 05:22:00,151 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:22:00,205 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:22:00,206 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 05:22:00,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:22:00 BoogieIcfgContainer [2025-01-09 05:22:00,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:22:00,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:22:00,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:22:00,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:22:00,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:21:50" (1/3) ... [2025-01-09 05:22:00,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18edeeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:22:00, skipping insertion in model container [2025-01-09 05:22:00,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:52" (2/3) ... [2025-01-09 05:22:00,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18edeeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:22:00, skipping insertion in model container [2025-01-09 05:22:00,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:22:00" (3/3) ... [2025-01-09 05:22:00,212 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.09.cil-2.c [2025-01-09 05:22:00,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:22:00,227 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.09.cil-2.c that has 8 procedures, 2496 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 05:22:00,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:22:00,328 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;@61a92b84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:22:00,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:22:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 2496 states, 2462 states have (on average 1.8419983753046303) internal successors, (4535), 2466 states have internal predecessors, (4535), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 05:22:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:00,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:00,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:00,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2082065581, now seen corresponding path program 1 times [2025-01-09 05:22:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:00,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850146736] [2025-01-09 05:22:00,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:00,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:00,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:00,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:00,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:00,641 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:22:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850146736] [2025-01-09 05:22:00,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850146736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:00,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:00,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:22:00,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878295006] [2025-01-09 05:22:00,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:00,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:22:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:00,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:22:00,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:22:00,678 INFO L87 Difference]: Start difference. First operand has 2496 states, 2462 states have (on average 1.8419983753046303) internal successors, (4535), 2466 states have internal predecessors, (4535), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:00,840 INFO L93 Difference]: Finished difference Result 4982 states and 9153 transitions. [2025-01-09 05:22:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:22:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:00,864 INFO L225 Difference]: With dead ends: 4982 [2025-01-09 05:22:00,865 INFO L226 Difference]: Without dead ends: 2428 [2025-01-09 05:22:00,871 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:22:00,873 INFO L435 NwaCegarLoop]: 4507 mSDtfsCounter, 477 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 8529 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:22:00,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 8529 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:22:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2025-01-09 05:22:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2428. [2025-01-09 05:22:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2395 states have (on average 1.8334029227557411) internal successors, (4391), 2398 states have internal predecessors, (4391), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:22:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4439 transitions. [2025-01-09 05:22:00,979 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4439 transitions. Word has length 144 [2025-01-09 05:22:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:00,980 INFO L471 AbstractCegarLoop]: Abstraction has 2428 states and 4439 transitions. [2025-01-09 05:22:00,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4439 transitions. [2025-01-09 05:22:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:00,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:00,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:00,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:22:00,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:00,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1924082325, now seen corresponding path program 1 times [2025-01-09 05:22:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:00,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471734534] [2025-01-09 05:22:00,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:01,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:01,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:01,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:01,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:01,259 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:22:01,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:01,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471734534] [2025-01-09 05:22:01,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471734534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:01,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:01,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:22:01,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675611686] [2025-01-09 05:22:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:01,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:22:01,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:01,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:22:01,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:22:01,263 INFO L87 Difference]: Start difference. First operand 2428 states and 4439 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:01,763 INFO L93 Difference]: Finished difference Result 3044 states and 5419 transitions. [2025-01-09 05:22:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:22:01,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:01,775 INFO L225 Difference]: With dead ends: 3044 [2025-01-09 05:22:01,775 INFO L226 Difference]: Without dead ends: 2754 [2025-01-09 05:22:01,778 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:22:01,778 INFO L435 NwaCegarLoop]: 4332 mSDtfsCounter, 4865 mSDsluCounter, 8865 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4882 SdHoareTripleChecker+Valid, 13197 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:01,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4882 Valid, 13197 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:22:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2025-01-09 05:22:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2729. [2025-01-09 05:22:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2671 states have (on average 1.809060277049794) internal successors, (4832), 2675 states have internal predecessors, (4832), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-01-09 05:22:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4917 transitions. [2025-01-09 05:22:01,859 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4917 transitions. Word has length 144 [2025-01-09 05:22:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:01,860 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4917 transitions. [2025-01-09 05:22:01,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4917 transitions. [2025-01-09 05:22:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:01,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:01,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, 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:22:01,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:22:01,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:01,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1841760913, now seen corresponding path program 1 times [2025-01-09 05:22:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053929696] [2025-01-09 05:22:01,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:01,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:01,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:01,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:01,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:02,086 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:22:02,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:02,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053929696] [2025-01-09 05:22:02,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053929696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:02,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:02,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999191581] [2025-01-09 05:22:02,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:02,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:02,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:02,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:02,088 INFO L87 Difference]: Start difference. First operand 2729 states and 4917 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:02,804 INFO L93 Difference]: Finished difference Result 3705 states and 6484 transitions. [2025-01-09 05:22:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:02,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:02,817 INFO L225 Difference]: With dead ends: 3705 [2025-01-09 05:22:02,817 INFO L226 Difference]: Without dead ends: 3114 [2025-01-09 05:22:02,820 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:22:02,821 INFO L435 NwaCegarLoop]: 4589 mSDtfsCounter, 4868 mSDsluCounter, 13793 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4885 SdHoareTripleChecker+Valid, 18382 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:02,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4885 Valid, 18382 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:22:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2025-01-09 05:22:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3009. [2025-01-09 05:22:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2926 states have (on average 1.7877648667122352) internal successors, (5231), 2931 states have internal predecessors, (5231), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-01-09 05:22:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 5355 transitions. [2025-01-09 05:22:02,903 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 5355 transitions. Word has length 144 [2025-01-09 05:22:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:02,904 INFO L471 AbstractCegarLoop]: Abstraction has 3009 states and 5355 transitions. [2025-01-09 05:22:02,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 5355 transitions. [2025-01-09 05:22:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:02,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:02,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:02,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:22:02,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1591372781, now seen corresponding path program 1 times [2025-01-09 05:22:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120397105] [2025-01-09 05:22:02,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:02,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:02,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:02,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:02,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:02,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:03,061 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:22:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120397105] [2025-01-09 05:22:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120397105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:03,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:03,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877037641] [2025-01-09 05:22:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:03,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:03,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:03,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:03,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:03,066 INFO L87 Difference]: Start difference. First operand 3009 states and 5355 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:03,717 INFO L93 Difference]: Finished difference Result 4589 states and 7885 transitions. [2025-01-09 05:22:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:03,733 INFO L225 Difference]: With dead ends: 4589 [2025-01-09 05:22:03,734 INFO L226 Difference]: Without dead ends: 3718 [2025-01-09 05:22:03,737 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:22:03,738 INFO L435 NwaCegarLoop]: 4581 mSDtfsCounter, 4860 mSDsluCounter, 13771 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4877 SdHoareTripleChecker+Valid, 18352 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:03,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4877 Valid, 18352 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:22:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2025-01-09 05:22:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3603. [2025-01-09 05:22:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3603 states, 3468 states have (on average 1.7560553633217992) internal successors, (6090), 3477 states have internal predecessors, (6090), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-01-09 05:22:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 6298 transitions. [2025-01-09 05:22:03,841 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 6298 transitions. Word has length 144 [2025-01-09 05:22:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:03,841 INFO L471 AbstractCegarLoop]: Abstraction has 3603 states and 6298 transitions. [2025-01-09 05:22:03,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 6298 transitions. [2025-01-09 05:22:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:03,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:03,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:03,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:22:03,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:03,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1103325675, now seen corresponding path program 1 times [2025-01-09 05:22:03,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:03,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594520427] [2025-01-09 05:22:03,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:03,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:03,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:03,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:03,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:03,976 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:22:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594520427] [2025-01-09 05:22:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594520427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:03,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:03,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:03,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664127437] [2025-01-09 05:22:03,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:03,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:03,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:03,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:03,977 INFO L87 Difference]: Start difference. First operand 3603 states and 6298 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:04,616 INFO L93 Difference]: Finished difference Result 6499 states and 10974 transitions. [2025-01-09 05:22:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:04,636 INFO L225 Difference]: With dead ends: 6499 [2025-01-09 05:22:04,637 INFO L226 Difference]: Without dead ends: 5034 [2025-01-09 05:22:04,642 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:22:04,643 INFO L435 NwaCegarLoop]: 4578 mSDtfsCounter, 4855 mSDsluCounter, 13762 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 18340 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:04,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 18340 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:22:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2025-01-09 05:22:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 4890. [2025-01-09 05:22:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4645 states have (on average 1.7192680301399355) internal successors, (7986), 4668 states have internal predecessors, (7986), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-01-09 05:22:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 8386 transitions. [2025-01-09 05:22:04,810 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 8386 transitions. Word has length 144 [2025-01-09 05:22:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:04,812 INFO L471 AbstractCegarLoop]: Abstraction has 4890 states and 8386 transitions. [2025-01-09 05:22:04,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 8386 transitions. [2025-01-09 05:22:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:04,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:04,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:04,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:22:04,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:04,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2099006419, now seen corresponding path program 1 times [2025-01-09 05:22:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:04,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504263882] [2025-01-09 05:22:04,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:04,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:04,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:04,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:04,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:04,991 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:22:04,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504263882] [2025-01-09 05:22:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504263882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614517621] [2025-01-09 05:22:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:04,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:04,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:04,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:04,993 INFO L87 Difference]: Start difference. First operand 4890 states and 8386 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:05,810 INFO L93 Difference]: Finished difference Result 10696 states and 17948 transitions. [2025-01-09 05:22:05,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:05,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:05,854 INFO L225 Difference]: With dead ends: 10696 [2025-01-09 05:22:05,855 INFO L226 Difference]: Without dead ends: 7944 [2025-01-09 05:22:05,866 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:22:05,867 INFO L435 NwaCegarLoop]: 4575 mSDtfsCounter, 4850 mSDsluCounter, 13753 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4867 SdHoareTripleChecker+Valid, 18328 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:05,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4867 Valid, 18328 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:22:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2025-01-09 05:22:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 7743. [2025-01-09 05:22:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7743 states, 7260 states have (on average 1.6911845730027548) internal successors, (12278), 7329 states have internal predecessors, (12278), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 05:22:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 13158 transitions. [2025-01-09 05:22:06,144 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 13158 transitions. Word has length 144 [2025-01-09 05:22:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:06,144 INFO L471 AbstractCegarLoop]: Abstraction has 7743 states and 13158 transitions. [2025-01-09 05:22:06,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 13158 transitions. [2025-01-09 05:22:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:06,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:06,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:06,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:22:06,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:06,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash 816834133, now seen corresponding path program 1 times [2025-01-09 05:22:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:06,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329210167] [2025-01-09 05:22:06,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:06,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:06,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:06,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:06,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:06,259 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:22:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329210167] [2025-01-09 05:22:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329210167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:06,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:06,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289997746] [2025-01-09 05:22:06,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:06,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:06,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:06,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:06,261 INFO L87 Difference]: Start difference. First operand 7743 states and 13158 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:06,959 INFO L93 Difference]: Finished difference Result 20147 states and 34262 transitions. [2025-01-09 05:22:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:06,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:07,013 INFO L225 Difference]: With dead ends: 20147 [2025-01-09 05:22:07,014 INFO L226 Difference]: Without dead ends: 14542 [2025-01-09 05:22:07,036 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:22:07,037 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4878 mSDsluCounter, 13229 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4895 SdHoareTripleChecker+Valid, 17583 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:07,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4895 Valid, 17583 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:22:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14542 states. [2025-01-09 05:22:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14542 to 14232. [2025-01-09 05:22:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14232 states, 13219 states have (on average 1.6837884862697632) internal successors, (22258), 13434 states have internal predecessors, (22258), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:22:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14232 states to 14232 states and 24482 transitions. [2025-01-09 05:22:07,526 INFO L78 Accepts]: Start accepts. Automaton has 14232 states and 24482 transitions. Word has length 144 [2025-01-09 05:22:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:07,526 INFO L471 AbstractCegarLoop]: Abstraction has 14232 states and 24482 transitions. [2025-01-09 05:22:07,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 14232 states and 24482 transitions. [2025-01-09 05:22:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:07,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:07,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:07,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:22:07,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:07,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1025641581, now seen corresponding path program 1 times [2025-01-09 05:22:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917921313] [2025-01-09 05:22:07,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:07,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:07,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:07,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:07,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:07,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:07,646 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:22:07,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:07,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917921313] [2025-01-09 05:22:07,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917921313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:07,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:07,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:22:07,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128885992] [2025-01-09 05:22:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:07,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:22:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:07,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:22:07,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:22:07,648 INFO L87 Difference]: Start difference. First operand 14232 states and 24482 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:08,155 INFO L93 Difference]: Finished difference Result 29756 states and 52195 transitions. [2025-01-09 05:22:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:22:08,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:08,217 INFO L225 Difference]: With dead ends: 29756 [2025-01-09 05:22:08,217 INFO L226 Difference]: Without dead ends: 17662 [2025-01-09 05:22:08,255 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:22:08,256 INFO L435 NwaCegarLoop]: 4309 mSDtfsCounter, 4598 mSDsluCounter, 8489 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4615 SdHoareTripleChecker+Valid, 12798 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:08,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4615 Valid, 12798 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:22:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17662 states. [2025-01-09 05:22:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17662 to 14232. [2025-01-09 05:22:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14232 states, 13219 states have (on average 1.6812920795824193) internal successors, (22225), 13434 states have internal predecessors, (22225), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:22:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14232 states to 14232 states and 24449 transitions. [2025-01-09 05:22:08,816 INFO L78 Accepts]: Start accepts. Automaton has 14232 states and 24449 transitions. Word has length 144 [2025-01-09 05:22:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:08,817 INFO L471 AbstractCegarLoop]: Abstraction has 14232 states and 24449 transitions. [2025-01-09 05:22:08,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 14232 states and 24449 transitions. [2025-01-09 05:22:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:08,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:08,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:08,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:22:08,824 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:08,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1547323029, now seen corresponding path program 1 times [2025-01-09 05:22:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024061019] [2025-01-09 05:22:08,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:08,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:08,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:08,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:08,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:08,937 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:22:08,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:08,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024061019] [2025-01-09 05:22:08,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024061019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:08,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389813905] [2025-01-09 05:22:08,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:08,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:08,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:08,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:08,939 INFO L87 Difference]: Start difference. First operand 14232 states and 24449 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:09,956 INFO L93 Difference]: Finished difference Result 41728 states and 73397 transitions. [2025-01-09 05:22:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:10,070 INFO L225 Difference]: With dead ends: 41728 [2025-01-09 05:22:10,071 INFO L226 Difference]: Without dead ends: 29634 [2025-01-09 05:22:10,108 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:22:10,111 INFO L435 NwaCegarLoop]: 4564 mSDtfsCounter, 4832 mSDsluCounter, 13721 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4849 SdHoareTripleChecker+Valid, 18285 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:10,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4849 Valid, 18285 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:22:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29634 states. [2025-01-09 05:22:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29634 to 29154. [2025-01-09 05:22:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29154 states, 26919 states have (on average 1.6917047438612132) internal successors, (45539), 27588 states have internal predecessors, (45539), 1177 states have call successors, (1177), 391 states have call predecessors, (1177), 1056 states have return successors, (5271), 1238 states have call predecessors, (5271), 1175 states have call successors, (5271) [2025-01-09 05:22:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29154 states to 29154 states and 51987 transitions. [2025-01-09 05:22:11,217 INFO L78 Accepts]: Start accepts. Automaton has 29154 states and 51987 transitions. Word has length 144 [2025-01-09 05:22:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:11,218 INFO L471 AbstractCegarLoop]: Abstraction has 29154 states and 51987 transitions. [2025-01-09 05:22:11,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 29154 states and 51987 transitions. [2025-01-09 05:22:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:11,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:11,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:11,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:22:11,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:11,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1214679891, now seen corresponding path program 1 times [2025-01-09 05:22:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697676376] [2025-01-09 05:22:11,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:11,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:11,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:11,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:11,383 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:22:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697676376] [2025-01-09 05:22:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697676376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:11,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:11,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560581099] [2025-01-09 05:22:11,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:11,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:11,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:11,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:11,384 INFO L87 Difference]: Start difference. First operand 29154 states and 51987 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:13,408 INFO L93 Difference]: Finished difference Result 92432 states and 172541 transitions. [2025-01-09 05:22:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:13,730 INFO L225 Difference]: With dead ends: 92432 [2025-01-09 05:22:13,730 INFO L226 Difference]: Without dead ends: 65416 [2025-01-09 05:22:13,813 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:22:13,814 INFO L435 NwaCegarLoop]: 4561 mSDtfsCounter, 4827 mSDsluCounter, 13712 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4844 SdHoareTripleChecker+Valid, 18273 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:13,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4844 Valid, 18273 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:22:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65416 states. [2025-01-09 05:22:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65416 to 64587. [2025-01-09 05:22:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64587 states, 59422 states have (on average 1.7140957894382551) internal successors, (101855), 61485 states have internal predecessors, (101855), 2329 states have call successors, (2329), 775 states have call predecessors, (2329), 2834 states have return successors, (18711), 2454 states have call predecessors, (18711), 2327 states have call successors, (18711) [2025-01-09 05:22:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64587 states to 64587 states and 122895 transitions. [2025-01-09 05:22:16,486 INFO L78 Accepts]: Start accepts. Automaton has 64587 states and 122895 transitions. Word has length 144 [2025-01-09 05:22:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:16,487 INFO L471 AbstractCegarLoop]: Abstraction has 64587 states and 122895 transitions. [2025-01-09 05:22:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 64587 states and 122895 transitions. [2025-01-09 05:22:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:16,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:16,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:16,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:22:16,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:16,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1151355179, now seen corresponding path program 1 times [2025-01-09 05:22:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767777460] [2025-01-09 05:22:16,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:16,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:16,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:16,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:16,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:22:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767777460] [2025-01-09 05:22:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767777460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:16,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347006231] [2025-01-09 05:22:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:16,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:16,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:16,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:16,647 INFO L87 Difference]: Start difference. First operand 64587 states and 122895 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:21,530 INFO L93 Difference]: Finished difference Result 220039 states and 444564 transitions. [2025-01-09 05:22:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:22:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:22,749 INFO L225 Difference]: With dead ends: 220039 [2025-01-09 05:22:22,749 INFO L226 Difference]: Without dead ends: 157590 [2025-01-09 05:22:22,910 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:22:22,910 INFO L435 NwaCegarLoop]: 4551 mSDtfsCounter, 4901 mSDsluCounter, 13679 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4917 SdHoareTripleChecker+Valid, 18230 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:22,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4917 Valid, 18230 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:22:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157590 states. [2025-01-09 05:22:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157590 to 147039. [2025-01-09 05:22:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147039 states, 134684 states have (on average 1.7363680912357815) internal successors, (233861), 140993 states have internal predecessors, (233861), 4505 states have call successors, (4505), 1543 states have call predecessors, (4505), 7848 states have return successors, (70039), 4758 states have call predecessors, (70039), 4503 states have call successors, (70039) [2025-01-09 05:22:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147039 states to 147039 states and 308405 transitions. [2025-01-09 05:22:29,883 INFO L78 Accepts]: Start accepts. Automaton has 147039 states and 308405 transitions. Word has length 144 [2025-01-09 05:22:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:29,883 INFO L471 AbstractCegarLoop]: Abstraction has 147039 states and 308405 transitions. [2025-01-09 05:22:29,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:22:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 147039 states and 308405 transitions. [2025-01-09 05:22:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:22:29,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:29,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:29,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:22:29,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:29,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:29,925 INFO L85 PathProgramCache]: Analyzing trace with hash 575789783, now seen corresponding path program 1 times [2025-01-09 05:22:29,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:29,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951856067] [2025-01-09 05:22:29,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:29,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:29,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:22:29,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:22:29,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:29,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:30,044 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:22:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:30,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951856067] [2025-01-09 05:22:30,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951856067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:30,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:30,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119340268] [2025-01-09 05:22:30,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:30,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:30,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:30,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:30,046 INFO L87 Difference]: Start difference. First operand 147039 states and 308405 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)