./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/pc_sfifo_2.cil-1+token_ring.12.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a41d14195dc7825ea8ff849a910a7045aa33d6087daf5af287d6c34e44b1032a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:55:20,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:55:20,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:55:20,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:55:20,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:55:20,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:55:20,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:55:20,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:55:20,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:55:20,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:55:20,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:55:20,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:55:20,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:55:20,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:55:20,471 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:55:20,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:55:20,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:55:20,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:55:20,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:55:20,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:55:20,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:55:20,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:55:20,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:55:20,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:55:20,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:55:20,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:55:20,474 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 -> a41d14195dc7825ea8ff849a910a7045aa33d6087daf5af287d6c34e44b1032a [2025-02-05 17:55:20,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:55:20,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:55:20,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:55:20,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:55:20,700 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:55:20,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-1.c [2025-02-05 17:55:21,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8acec709a/e1fb9576c43d474fb17c5ec804d3855c/FLAGc5eb19e19 [2025-02-05 17:55:22,280 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:55:22,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-1.c [2025-02-05 17:55:22,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8acec709a/e1fb9576c43d474fb17c5ec804d3855c/FLAGc5eb19e19 [2025-02-05 17:55:22,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8acec709a/e1fb9576c43d474fb17c5ec804d3855c [2025-02-05 17:55:22,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:55:22,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:55:22,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:55:22,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:55:22,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:55:22,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c89a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22, skipping insertion in model container [2025-02-05 17:55:22,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:55:22,477 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/pc_sfifo_2.cil-1+token_ring.12.cil-1.c[914,927] [2025-02-05 17:55:22,523 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/pc_sfifo_2.cil-1+token_ring.12.cil-1.c[7115,7128] [2025-02-05 17:55:22,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:55:22,623 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:55:22,630 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/pc_sfifo_2.cil-1+token_ring.12.cil-1.c[914,927] [2025-02-05 17:55:22,641 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/pc_sfifo_2.cil-1+token_ring.12.cil-1.c[7115,7128] [2025-02-05 17:55:22,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:55:22,693 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:55:22,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22 WrapperNode [2025-02-05 17:55:22,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:55:22,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:55:22,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:55:22,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:55:22,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,745 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1017 [2025-02-05 17:55:22,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:55:22,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:55:22,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:55:22,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:55:22,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,816 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-02-05 17:55:22,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:55:22,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:55:22,875 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:55:22,875 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:55:22,876 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (1/1) ... [2025-02-05 17:55:22,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:55:22,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:22,926 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-02-05 17:55:22,932 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-02-05 17:55:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:55:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:55:22,948 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:55:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:55:22,948 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:55:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:55:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:55:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:55:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:55:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:55:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:55:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:55:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:55:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:55:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:55:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:55:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:55:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:55:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:55:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:55:22,950 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:55:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:55:22,950 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:55:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:55:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:55:22,950 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:55:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:55:22,950 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:55:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:55:22,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:55:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:55:22,951 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:55:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:55:22,951 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:55:23,043 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:55:23,045 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:55:23,922 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-02-05 17:55:23,922 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:55:23,940 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:55:23,941 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:55:23,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:55:23 BoogieIcfgContainer [2025-02-05 17:55:23,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:55:23,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:55:23,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:55:23,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:55:23,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:55:22" (1/3) ... [2025-02-05 17:55:23,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9ba9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:55:23, skipping insertion in model container [2025-02-05 17:55:23,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:22" (2/3) ... [2025-02-05 17:55:23,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9ba9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:55:23, skipping insertion in model container [2025-02-05 17:55:23,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:55:23" (3/3) ... [2025-02-05 17:55:23,959 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.12.cil-1.c [2025-02-05 17:55:23,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:55:23,986 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.12.cil-1.c that has 16 procedures, 519 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-02-05 17:55:24,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:55:24,069 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;@309423a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:55:24,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:55:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 520 states, 459 states have (on average 1.5642701525054465) internal successors, (718), 468 states have internal predecessors, (718), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 17:55:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:24,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:24,086 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] [2025-02-05 17:55:24,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:24,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash -880506321, now seen corresponding path program 1 times [2025-02-05 17:55:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737165190] [2025-02-05 17:55:24,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:24,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:24,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:24,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:24,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:24,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737165190] [2025-02-05 17:55:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737165190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709599894] [2025-02-05 17:55:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:24,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:24,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:24,438 INFO L87 Difference]: Start difference. First operand has 520 states, 459 states have (on average 1.5642701525054465) internal successors, (718), 468 states have internal predecessors, (718), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:24,547 INFO L93 Difference]: Finished difference Result 1012 states and 1557 transitions. [2025-02-05 17:55:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:24,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:55:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:24,558 INFO L225 Difference]: With dead ends: 1012 [2025-02-05 17:55:24,559 INFO L226 Difference]: Without dead ends: 508 [2025-02-05 17:55:24,563 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-02-05 17:55:24,565 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 133 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1411 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-02-05 17:55:24,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1411 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-02-05 17:55:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-02-05 17:55:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 451 states have (on average 1.5188470066518847) internal successors, (685), 456 states have internal predecessors, (685), 42 states have call successors, (42), 15 states have call predecessors, (42), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 17:55:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 765 transitions. [2025-02-05 17:55:24,626 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 765 transitions. Word has length 65 [2025-02-05 17:55:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:24,627 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 765 transitions. [2025-02-05 17:55:24,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 765 transitions. [2025-02-05 17:55:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:24,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:24,633 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] [2025-02-05 17:55:24,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:55:24,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:24,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash -900843696, now seen corresponding path program 1 times [2025-02-05 17:55:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593932118] [2025-02-05 17:55:24,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:24,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:24,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:24,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:24,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:24,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:24,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593932118] [2025-02-05 17:55:24,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593932118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:24,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:24,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648278130] [2025-02-05 17:55:24,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:24,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:24,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:24,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:24,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:24,829 INFO L87 Difference]: Start difference. First operand 508 states and 765 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:25,692 INFO L93 Difference]: Finished difference Result 703 states and 1035 transitions. [2025-02-05 17:55:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:25,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:55:25,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:25,697 INFO L225 Difference]: With dead ends: 703 [2025-02-05 17:55:25,697 INFO L226 Difference]: Without dead ends: 613 [2025-02-05 17:55:25,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-02-05 17:55:25,699 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 476 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:25,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1648 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:55:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-02-05 17:55:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 606. [2025-02-05 17:55:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 529 states have (on average 1.4933837429111532) internal successors, (790), 536 states have internal predecessors, (790), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2025-02-05 17:55:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 897 transitions. [2025-02-05 17:55:25,743 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 897 transitions. Word has length 65 [2025-02-05 17:55:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:25,743 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 897 transitions. [2025-02-05 17:55:25,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 897 transitions. [2025-02-05 17:55:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:25,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:25,745 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] [2025-02-05 17:55:25,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:55:25,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:25,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1958783629, now seen corresponding path program 1 times [2025-02-05 17:55:25,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:25,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595363548] [2025-02-05 17:55:25,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:25,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:25,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:25,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:25,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:25,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:25,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595363548] [2025-02-05 17:55:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595363548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006111121] [2025-02-05 17:55:25,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:25,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:25,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:25,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:25,958 INFO L87 Difference]: Start difference. First operand 606 states and 897 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:26,758 INFO L93 Difference]: Finished difference Result 929 states and 1330 transitions. [2025-02-05 17:55:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:26,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:55:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:26,762 INFO L225 Difference]: With dead ends: 929 [2025-02-05 17:55:26,762 INFO L226 Difference]: Without dead ends: 748 [2025-02-05 17:55:26,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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-02-05 17:55:26,764 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1124 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:26,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1697 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-02-05 17:55:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 704. [2025-02-05 17:55:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 607 states have (on average 1.472817133443163) internal successors, (894), 616 states have internal predecessors, (894), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2025-02-05 17:55:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1031 transitions. [2025-02-05 17:55:26,802 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1031 transitions. Word has length 65 [2025-02-05 17:55:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:26,802 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1031 transitions. [2025-02-05 17:55:26,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1031 transitions. [2025-02-05 17:55:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:26,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:26,804 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] [2025-02-05 17:55:26,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:55:26,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:26,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1202993074, now seen corresponding path program 1 times [2025-02-05 17:55:26,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:26,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125164706] [2025-02-05 17:55:26,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:26,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:26,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:26,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:26,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:26,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125164706] [2025-02-05 17:55:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125164706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:26,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794190739] [2025-02-05 17:55:26,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:26,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:26,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:26,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:26,928 INFO L87 Difference]: Start difference. First operand 704 states and 1031 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:27,027 INFO L93 Difference]: Finished difference Result 982 states and 1407 transitions. [2025-02-05 17:55:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:27,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-02-05 17:55:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:27,035 INFO L225 Difference]: With dead ends: 982 [2025-02-05 17:55:27,035 INFO L226 Difference]: Without dead ends: 709 [2025-02-05 17:55:27,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:27,037 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 0 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3805 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:27,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3805 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-02-05 17:55:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2025-02-05 17:55:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 611 states have (on average 1.4664484451718494) internal successors, (896), 620 states have internal predecessors, (896), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2025-02-05 17:55:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1034 transitions. [2025-02-05 17:55:27,112 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1034 transitions. Word has length 65 [2025-02-05 17:55:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:27,112 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1034 transitions. [2025-02-05 17:55:27,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1034 transitions. [2025-02-05 17:55:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:27,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:27,114 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] [2025-02-05 17:55:27,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:55:27,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:27,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 429810925, now seen corresponding path program 1 times [2025-02-05 17:55:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295835525] [2025-02-05 17:55:27,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:27,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:27,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:27,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:27,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:27,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:27,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295835525] [2025-02-05 17:55:27,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295835525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:27,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:27,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:55:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261122218] [2025-02-05 17:55:27,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:27,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:55:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:27,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:55:27,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:55:27,277 INFO L87 Difference]: Start difference. First operand 709 states and 1034 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:55:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:28,731 INFO L93 Difference]: Finished difference Result 1977 states and 2738 transitions. [2025-02-05 17:55:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:55:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-02-05 17:55:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:28,738 INFO L225 Difference]: With dead ends: 1977 [2025-02-05 17:55:28,739 INFO L226 Difference]: Without dead ends: 1681 [2025-02-05 17:55:28,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:55:28,741 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 3262 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:28,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3276 Valid, 2042 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 17:55:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-02-05 17:55:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1627. [2025-02-05 17:55:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1343 states have (on average 1.3700670141474312) internal successors, (1840), 1367 states have internal predecessors, (1840), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2025-02-05 17:55:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2180 transitions. [2025-02-05 17:55:28,840 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2180 transitions. Word has length 65 [2025-02-05 17:55:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:28,840 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 2180 transitions. [2025-02-05 17:55:28,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:55:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2180 transitions. [2025-02-05 17:55:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:28,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:28,841 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] [2025-02-05 17:55:28,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:55:28,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:28,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1054139125, now seen corresponding path program 1 times [2025-02-05 17:55:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808535478] [2025-02-05 17:55:28,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:28,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:28,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:28,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:28,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:28,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-02-05 17:55:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808535478] [2025-02-05 17:55:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808535478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:28,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:28,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:28,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475830161] [2025-02-05 17:55:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:28,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:28,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:28,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:28,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:28,942 INFO L87 Difference]: Start difference. First operand 1627 states and 2180 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:29,093 INFO L93 Difference]: Finished difference Result 2865 states and 3764 transitions. [2025-02-05 17:55:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-02-05 17:55:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:29,109 INFO L225 Difference]: With dead ends: 2865 [2025-02-05 17:55:29,109 INFO L226 Difference]: Without dead ends: 1657 [2025-02-05 17:55:29,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:29,116 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 0 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3805 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:29,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3805 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-02-05 17:55:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2025-02-05 17:55:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1367 states have (on average 1.357717629846379) internal successors, (1856), 1391 states have internal predecessors, (1856), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2025-02-05 17:55:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2202 transitions. [2025-02-05 17:55:29,245 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2202 transitions. Word has length 66 [2025-02-05 17:55:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:29,245 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2202 transitions. [2025-02-05 17:55:29,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2202 transitions. [2025-02-05 17:55:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:29,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:29,247 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] [2025-02-05 17:55:29,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:55:29,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:29,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1042822998, now seen corresponding path program 1 times [2025-02-05 17:55:29,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672021925] [2025-02-05 17:55:29,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:29,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:29,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:29,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:29,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672021925] [2025-02-05 17:55:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672021925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:29,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:29,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:55:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184805683] [2025-02-05 17:55:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:29,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:55:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:29,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:55:29,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:55:29,293 INFO L87 Difference]: Start difference. First operand 1657 states and 2202 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:29,831 INFO L93 Difference]: Finished difference Result 4013 states and 5190 transitions. [2025-02-05 17:55:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:55:29,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 17:55:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:29,842 INFO L225 Difference]: With dead ends: 4013 [2025-02-05 17:55:29,843 INFO L226 Difference]: Without dead ends: 2776 [2025-02-05 17:55:29,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:29,845 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 1060 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:29,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 837 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:55:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2025-02-05 17:55:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2772. [2025-02-05 17:55:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2226 states have (on average 1.3018867924528301) internal successors, (2898), 2271 states have internal predecessors, (2898), 274 states have call successors, (274), 216 states have call predecessors, (274), 270 states have return successors, (398), 287 states have call predecessors, (398), 270 states have call successors, (398) [2025-02-05 17:55:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3570 transitions. [2025-02-05 17:55:29,958 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3570 transitions. Word has length 66 [2025-02-05 17:55:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:29,959 INFO L471 AbstractCegarLoop]: Abstraction has 2772 states and 3570 transitions. [2025-02-05 17:55:29,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3570 transitions. [2025-02-05 17:55:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:55:29,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:29,960 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] [2025-02-05 17:55:29,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:55:29,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:29,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1840697382, now seen corresponding path program 1 times [2025-02-05 17:55:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263363845] [2025-02-05 17:55:29,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:29,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:55:29,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:55:29,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:29,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:29,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:29,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263363845] [2025-02-05 17:55:29,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263363845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:29,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:29,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:29,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594026887] [2025-02-05 17:55:29,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:29,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:29,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:29,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:29,991 INFO L87 Difference]: Start difference. First operand 2772 states and 3570 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:30,194 INFO L93 Difference]: Finished difference Result 5904 states and 7494 transitions. [2025-02-05 17:55:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:30,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-02-05 17:55:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:30,209 INFO L225 Difference]: With dead ends: 5904 [2025-02-05 17:55:30,210 INFO L226 Difference]: Without dead ends: 3513 [2025-02-05 17:55:30,216 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-02-05 17:55:30,217 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 101 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:30,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1504 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2025-02-05 17:55:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3445. [2025-02-05 17:55:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 2746 states have (on average 1.2884195193008012) internal successors, (3538), 2797 states have internal predecessors, (3538), 348 states have call successors, (348), 280 states have call predecessors, (348), 349 states have return successors, (490), 370 states have call predecessors, (490), 344 states have call successors, (490) [2025-02-05 17:55:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4376 transitions. [2025-02-05 17:55:30,399 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4376 transitions. Word has length 67 [2025-02-05 17:55:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:30,400 INFO L471 AbstractCegarLoop]: Abstraction has 3445 states and 4376 transitions. [2025-02-05 17:55:30,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4376 transitions. [2025-02-05 17:55:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 17:55:30,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:30,401 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] [2025-02-05 17:55:30,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:55:30,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:30,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 753937410, now seen corresponding path program 1 times [2025-02-05 17:55:30,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:30,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303837797] [2025-02-05 17:55:30,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:30,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:55:30,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:55:30,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:30,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:30,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303837797] [2025-02-05 17:55:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303837797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:30,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:30,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:30,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033628965] [2025-02-05 17:55:30,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:30,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:30,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:30,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:30,431 INFO L87 Difference]: Start difference. First operand 3445 states and 4376 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:30,476 INFO L93 Difference]: Finished difference Result 3865 states and 4881 transitions. [2025-02-05 17:55:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:30,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-02-05 17:55:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:30,483 INFO L225 Difference]: With dead ends: 3865 [2025-02-05 17:55:30,483 INFO L226 Difference]: Without dead ends: 834 [2025-02-05 17:55:30,488 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-02-05 17:55:30,489 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 725 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:30,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 743 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-02-05 17:55:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 790. [2025-02-05 17:55:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 663 states have (on average 1.3740573152337858) internal successors, (911), 672 states have internal predecessors, (911), 76 states have call successors, (76), 45 states have call predecessors, (76), 49 states have return successors, (81), 75 states have call predecessors, (81), 72 states have call successors, (81) [2025-02-05 17:55:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2025-02-05 17:55:30,519 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 73 [2025-02-05 17:55:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:30,519 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2025-02-05 17:55:30,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2025-02-05 17:55:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:55:30,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:30,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:30,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:55:30,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:30,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:30,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1972662034, now seen corresponding path program 1 times [2025-02-05 17:55:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114314010] [2025-02-05 17:55:30,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:30,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:55:30,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:55:30,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:30,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 17:55:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:30,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114314010] [2025-02-05 17:55:30,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114314010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:30,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:30,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928590794] [2025-02-05 17:55:30,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:30,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:30,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:30,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:30,599 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:55:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:31,460 INFO L93 Difference]: Finished difference Result 1523 states and 1899 transitions. [2025-02-05 17:55:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 17:55:31,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2025-02-05 17:55:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:31,465 INFO L225 Difference]: With dead ends: 1523 [2025-02-05 17:55:31,465 INFO L226 Difference]: Without dead ends: 1029 [2025-02-05 17:55:31,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:55:31,467 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 641 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:31,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 2030 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-02-05 17:55:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 989. [2025-02-05 17:55:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 812 states have (on average 1.3238916256157636) internal successors, (1075), 823 states have internal predecessors, (1075), 100 states have call successors, (100), 66 states have call predecessors, (100), 75 states have return successors, (114), 102 states have call predecessors, (114), 96 states have call successors, (114) [2025-02-05 17:55:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1289 transitions. [2025-02-05 17:55:31,507 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1289 transitions. Word has length 84 [2025-02-05 17:55:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:31,508 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1289 transitions. [2025-02-05 17:55:31,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:55:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1289 transitions. [2025-02-05 17:55:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:55:31,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:31,510 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:31,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:55:31,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:31,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1555785781, now seen corresponding path program 1 times [2025-02-05 17:55:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:31,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321527558] [2025-02-05 17:55:31,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:31,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:31,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:55:31,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:55:31,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:31,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-05 17:55:31,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321527558] [2025-02-05 17:55:31,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321527558] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:55:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677061939] [2025-02-05 17:55:31,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:31,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:55:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:31,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:55:31,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:55:31,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:55:31,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:55:31,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:31,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:31,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 17:55:31,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:55:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 17:55:31,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:55:31,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677061939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:31,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:55:31,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 17:55:31,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893784931] [2025-02-05 17:55:31,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:31,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:31,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:31,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:55:31,924 INFO L87 Difference]: Start difference. First operand 989 states and 1289 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 17:55:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:31,955 INFO L93 Difference]: Finished difference Result 1087 states and 1389 transitions. [2025-02-05 17:55:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:31,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-02-05 17:55:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:31,959 INFO L225 Difference]: With dead ends: 1087 [2025-02-05 17:55:31,959 INFO L226 Difference]: Without dead ends: 411 [2025-02-05 17:55:31,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:55:31,962 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 0 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3474 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:31,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3474 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-05 17:55:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-05 17:55:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 376 states have (on average 1.5425531914893618) internal successors, (580), 378 states have internal predecessors, (580), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 17:55:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 634 transitions. [2025-02-05 17:55:31,974 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 634 transitions. Word has length 145 [2025-02-05 17:55:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:31,974 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 634 transitions. [2025-02-05 17:55:31,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 17:55:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 634 transitions. [2025-02-05 17:55:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:31,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:31,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:31,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:55:32,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 17:55:32,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:32,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1976500757, now seen corresponding path program 1 times [2025-02-05 17:55:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940964942] [2025-02-05 17:55:32,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:32,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:32,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:32,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:32,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:32,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:32,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940964942] [2025-02-05 17:55:32,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940964942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:32,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:32,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:32,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703853346] [2025-02-05 17:55:32,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:32,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:32,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:32,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:32,311 INFO L87 Difference]: Start difference. First operand 411 states and 634 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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-02-05 17:55:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:32,800 INFO L93 Difference]: Finished difference Result 1239 states and 1928 transitions. [2025-02-05 17:55:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:32,805 INFO L225 Difference]: With dead ends: 1239 [2025-02-05 17:55:32,805 INFO L226 Difference]: Without dead ends: 849 [2025-02-05 17:55:32,806 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-02-05 17:55:32,807 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1192 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:32,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1789 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:55:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-02-05 17:55:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 818. [2025-02-05 17:55:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 755 states have (on average 1.552317880794702) internal successors, (1172), 758 states have internal predecessors, (1172), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:55:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1269 transitions. [2025-02-05 17:55:32,835 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1269 transitions. Word has length 179 [2025-02-05 17:55:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:32,835 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1269 transitions. [2025-02-05 17:55:32,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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-02-05 17:55:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1269 transitions. [2025-02-05 17:55:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:32,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:32,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:32,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:55:32,838 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:32,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -863852781, now seen corresponding path program 1 times [2025-02-05 17:55:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319486929] [2025-02-05 17:55:32,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:32,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:32,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:32,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:32,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:33,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319486929] [2025-02-05 17:55:33,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319486929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:33,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:33,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:33,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455439462] [2025-02-05 17:55:33,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:33,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:33,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:33,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:33,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:33,021 INFO L87 Difference]: Start difference. First operand 818 states and 1269 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:33,741 INFO L93 Difference]: Finished difference Result 2130 states and 3343 transitions. [2025-02-05 17:55:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:33,750 INFO L225 Difference]: With dead ends: 2130 [2025-02-05 17:55:33,751 INFO L226 Difference]: Without dead ends: 1333 [2025-02-05 17:55:33,753 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-02-05 17:55:33,754 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 1201 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 3497 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:33,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 3497 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-02-05 17:55:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1198. [2025-02-05 17:55:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1107 states have (on average 1.5447154471544715) internal successors, (1710), 1111 states have internal predecessors, (1710), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-02-05 17:55:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1852 transitions. [2025-02-05 17:55:33,803 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1852 transitions. Word has length 179 [2025-02-05 17:55:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:33,803 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1852 transitions. [2025-02-05 17:55:33,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1852 transitions. [2025-02-05 17:55:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:33,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:33,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:33,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:55:33,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:33,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1748588588, now seen corresponding path program 1 times [2025-02-05 17:55:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:33,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684381226] [2025-02-05 17:55:33,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:33,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:33,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:33,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:33,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:33,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:33,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684381226] [2025-02-05 17:55:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684381226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:33,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321728089] [2025-02-05 17:55:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:33,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:33,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:33,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:33,985 INFO L87 Difference]: Start difference. First operand 1198 states and 1852 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:34,715 INFO L93 Difference]: Finished difference Result 3340 states and 5231 transitions. [2025-02-05 17:55:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:34,724 INFO L225 Difference]: With dead ends: 3340 [2025-02-05 17:55:34,725 INFO L226 Difference]: Without dead ends: 2163 [2025-02-05 17:55:34,728 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-02-05 17:55:34,728 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1196 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:34,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 3481 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2025-02-05 17:55:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2007. [2025-02-05 17:55:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1858 states have (on average 1.5484391819160388) internal successors, (2877), 1866 states have internal predecessors, (2877), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-02-05 17:55:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3115 transitions. [2025-02-05 17:55:34,788 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3115 transitions. Word has length 179 [2025-02-05 17:55:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:34,788 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 3115 transitions. [2025-02-05 17:55:34,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3115 transitions. [2025-02-05 17:55:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:34,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:34,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:34,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:55:34,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:34,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2054223117, now seen corresponding path program 1 times [2025-02-05 17:55:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:34,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591061011] [2025-02-05 17:55:34,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:34,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:34,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:34,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:34,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:34,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:34,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591061011] [2025-02-05 17:55:34,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591061011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:34,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:34,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:34,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110389371] [2025-02-05 17:55:34,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:34,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:34,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:34,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:34,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:34,959 INFO L87 Difference]: Start difference. First operand 2007 states and 3115 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:35,638 INFO L93 Difference]: Finished difference Result 5951 states and 9392 transitions. [2025-02-05 17:55:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:35,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:35,651 INFO L225 Difference]: With dead ends: 5951 [2025-02-05 17:55:35,651 INFO L226 Difference]: Without dead ends: 3965 [2025-02-05 17:55:35,657 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-02-05 17:55:35,657 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 1191 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:35,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 3469 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2025-02-05 17:55:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3766. [2025-02-05 17:55:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 3495 states have (on average 1.5659513590844063) internal successors, (5473), 3517 states have internal predecessors, (5473), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-02-05 17:55:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 5927 transitions. [2025-02-05 17:55:35,761 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 5927 transitions. Word has length 179 [2025-02-05 17:55:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:35,762 INFO L471 AbstractCegarLoop]: Abstraction has 3766 states and 5927 transitions. [2025-02-05 17:55:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 5927 transitions. [2025-02-05 17:55:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:35,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:35,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:35,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:55:35,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1538148340, now seen corresponding path program 1 times [2025-02-05 17:55:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:35,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148798209] [2025-02-05 17:55:35,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:35,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:35,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:35,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:35,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:35,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148798209] [2025-02-05 17:55:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148798209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:35,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:35,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086766269] [2025-02-05 17:55:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:35,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:35,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:35,907 INFO L87 Difference]: Start difference. First operand 3766 states and 5927 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:36,707 INFO L93 Difference]: Finished difference Result 11718 states and 18846 transitions. [2025-02-05 17:55:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:36,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:36,737 INFO L225 Difference]: With dead ends: 11718 [2025-02-05 17:55:36,737 INFO L226 Difference]: Without dead ends: 7973 [2025-02-05 17:55:36,746 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-02-05 17:55:36,747 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 1186 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:36,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 3457 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7973 states. [2025-02-05 17:55:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7973 to 7689. [2025-02-05 17:55:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.5954443823365008) internal successors, (11417), 7224 states have internal predecessors, (11417), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:55:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12399 transitions. [2025-02-05 17:55:37,028 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12399 transitions. Word has length 179 [2025-02-05 17:55:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:37,028 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12399 transitions. [2025-02-05 17:55:37,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12399 transitions. [2025-02-05 17:55:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:37,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:37,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:55:37,032 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1809652013, now seen corresponding path program 1 times [2025-02-05 17:55:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:37,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436030959] [2025-02-05 17:55:37,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:37,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:37,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:37,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:37,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436030959] [2025-02-05 17:55:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436030959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:37,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33954619] [2025-02-05 17:55:37,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:37,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:37,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:37,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:37,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:37,151 INFO L87 Difference]: Start difference. First operand 7689 states and 12399 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:37,618 INFO L93 Difference]: Finished difference Result 17183 states and 28457 transitions. [2025-02-05 17:55:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:37,661 INFO L225 Difference]: With dead ends: 17183 [2025-02-05 17:55:37,662 INFO L226 Difference]: Without dead ends: 9515 [2025-02-05 17:55:37,679 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-02-05 17:55:37,680 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 849 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:37,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1284 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9515 states. [2025-02-05 17:55:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9515 to 7689. [2025-02-05 17:55:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.593068753493572) internal successors, (11400), 7224 states have internal predecessors, (11400), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:55:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12382 transitions. [2025-02-05 17:55:38,081 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12382 transitions. Word has length 179 [2025-02-05 17:55:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:38,081 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12382 transitions. [2025-02-05 17:55:38,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12382 transitions. [2025-02-05 17:55:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:38,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:38,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:38,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:55:38,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:38,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1086361580, now seen corresponding path program 1 times [2025-02-05 17:55:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139867187] [2025-02-05 17:55:38,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:38,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:38,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:38,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:38,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:38,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139867187] [2025-02-05 17:55:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139867187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822209615] [2025-02-05 17:55:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:38,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:38,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:38,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:38,204 INFO L87 Difference]: Start difference. First operand 7689 states and 12382 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:38,698 INFO L93 Difference]: Finished difference Result 17100 states and 28257 transitions. [2025-02-05 17:55:38,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:38,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:38,723 INFO L225 Difference]: With dead ends: 17100 [2025-02-05 17:55:38,723 INFO L226 Difference]: Without dead ends: 9432 [2025-02-05 17:55:38,734 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-02-05 17:55:38,735 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 846 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:38,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1276 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9432 states. [2025-02-05 17:55:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9432 to 7689. [2025-02-05 17:55:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.5906931246506428) internal successors, (11383), 7224 states have internal predecessors, (11383), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:55:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12365 transitions. [2025-02-05 17:55:38,944 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12365 transitions. Word has length 179 [2025-02-05 17:55:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:38,944 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12365 transitions. [2025-02-05 17:55:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12365 transitions. [2025-02-05 17:55:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:38,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:38,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:38,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:55:38,948 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:38,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash 599538355, now seen corresponding path program 1 times [2025-02-05 17:55:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:38,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966509852] [2025-02-05 17:55:38,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:38,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:38,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:38,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:38,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:39,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966509852] [2025-02-05 17:55:39,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966509852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:39,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:39,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051920242] [2025-02-05 17:55:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:39,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:39,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:39,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:39,044 INFO L87 Difference]: Start difference. First operand 7689 states and 12365 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:39,535 INFO L93 Difference]: Finished difference Result 17017 states and 28057 transitions. [2025-02-05 17:55:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:39,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:39,562 INFO L225 Difference]: With dead ends: 17017 [2025-02-05 17:55:39,562 INFO L226 Difference]: Without dead ends: 9349 [2025-02-05 17:55:39,578 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-02-05 17:55:39,579 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 843 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:39,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1268 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9349 states. [2025-02-05 17:55:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9349 to 7689. [2025-02-05 17:55:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.5883174958077138) internal successors, (11366), 7224 states have internal predecessors, (11366), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:55:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12348 transitions. [2025-02-05 17:55:39,806 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12348 transitions. Word has length 179 [2025-02-05 17:55:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:39,806 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12348 transitions. [2025-02-05 17:55:39,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12348 transitions. [2025-02-05 17:55:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:39,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:39,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:39,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:55:39,812 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:39,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash 792469556, now seen corresponding path program 1 times [2025-02-05 17:55:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:39,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609184801] [2025-02-05 17:55:39,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:39,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:39,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:39,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:39,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:39,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:39,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:39,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609184801] [2025-02-05 17:55:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609184801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:39,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:39,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005951992] [2025-02-05 17:55:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:39,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:39,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:39,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:39,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:39,941 INFO L87 Difference]: Start difference. First operand 7689 states and 12348 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:40,963 INFO L93 Difference]: Finished difference Result 24513 states and 40375 transitions. [2025-02-05 17:55:40,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:40,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:41,012 INFO L225 Difference]: With dead ends: 24513 [2025-02-05 17:55:41,013 INFO L226 Difference]: Without dead ends: 16845 [2025-02-05 17:55:41,028 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-02-05 17:55:41,031 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 1157 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:41,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 3388 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16845 states. [2025-02-05 17:55:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16845 to 16453. [2025-02-05 17:55:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 15342 states have (on average 1.6211706426802241) internal successors, (24872), 15556 states have internal predecessors, (24872), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:55:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 27294 transitions. [2025-02-05 17:55:41,788 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 27294 transitions. Word has length 179 [2025-02-05 17:55:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:41,789 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 27294 transitions. [2025-02-05 17:55:41,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 27294 transitions. [2025-02-05 17:55:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:41,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:41,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:41,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:55:41,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:41,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash 660145811, now seen corresponding path program 1 times [2025-02-05 17:55:41,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:41,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717533923] [2025-02-05 17:55:41,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:41,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:41,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:41,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717533923] [2025-02-05 17:55:41,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717533923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:41,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036448279] [2025-02-05 17:55:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:41,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:41,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:41,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:41,921 INFO L87 Difference]: Start difference. First operand 16453 states and 27294 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:42,728 INFO L93 Difference]: Finished difference Result 37295 states and 63729 transitions. [2025-02-05 17:55:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:42,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:42,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:42,788 INFO L225 Difference]: With dead ends: 37295 [2025-02-05 17:55:42,789 INFO L226 Difference]: Without dead ends: 20863 [2025-02-05 17:55:42,822 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-02-05 17:55:42,823 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 839 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:42,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1254 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20863 states. [2025-02-05 17:55:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20863 to 16453. [2025-02-05 17:55:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 15342 states have (on average 1.6190196845261373) internal successors, (24839), 15556 states have internal predecessors, (24839), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:55:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 27261 transitions. [2025-02-05 17:55:43,490 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 27261 transitions. Word has length 179 [2025-02-05 17:55:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:43,490 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 27261 transitions. [2025-02-05 17:55:43,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 27261 transitions. [2025-02-05 17:55:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:43,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:43,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:43,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:55:43,496 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1625708628, now seen corresponding path program 1 times [2025-02-05 17:55:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200130176] [2025-02-05 17:55:43,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:43,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:43,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:43,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:43,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:43,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:43,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200130176] [2025-02-05 17:55:43,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200130176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:43,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:43,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022739286] [2025-02-05 17:55:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:43,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:43,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:43,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:43,595 INFO L87 Difference]: Start difference. First operand 16453 states and 27261 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:45,006 INFO L93 Difference]: Finished difference Result 53631 states and 91800 transitions. [2025-02-05 17:55:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:45,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:45,114 INFO L225 Difference]: With dead ends: 53631 [2025-02-05 17:55:45,115 INFO L226 Difference]: Without dead ends: 37199 [2025-02-05 17:55:45,161 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-02-05 17:55:45,166 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1144 mSDsluCounter, 2539 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:45,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 3357 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37199 states. [2025-02-05 17:55:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37199 to 36573. [2025-02-05 17:55:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36573 states, 34144 states have (on average 1.6547856138706654) internal successors, (56501), 34812 states have internal predecessors, (56501), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:55:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36573 states to 36573 states and 63339 transitions. [2025-02-05 17:55:46,993 INFO L78 Accepts]: Start accepts. Automaton has 36573 states and 63339 transitions. Word has length 179 [2025-02-05 17:55:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 36573 states and 63339 transitions. [2025-02-05 17:55:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 36573 states and 63339 transitions. [2025-02-05 17:55:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:47,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:47,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:47,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:55:47,006 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:47,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:47,006 INFO L85 PathProgramCache]: Analyzing trace with hash 964119155, now seen corresponding path program 1 times [2025-02-05 17:55:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:47,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481911931] [2025-02-05 17:55:47,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:47,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:47,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:47,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:47,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:47,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481911931] [2025-02-05 17:55:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481911931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:47,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:47,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516358563] [2025-02-05 17:55:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:47,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:47,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:47,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:47,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:47,141 INFO L87 Difference]: Start difference. First operand 36573 states and 63339 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:50,729 INFO L93 Difference]: Finished difference Result 122001 states and 220708 transitions. [2025-02-05 17:55:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:50,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:51,253 INFO L225 Difference]: With dead ends: 122001 [2025-02-05 17:55:51,254 INFO L226 Difference]: Without dead ends: 85449 [2025-02-05 17:55:51,365 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-02-05 17:55:51,366 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 1139 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:51,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 3345 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85449 states. [2025-02-05 17:55:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85449 to 84346. [2025-02-05 17:55:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84346 states, 78795 states have (on average 1.693013516086046) internal successors, (133401), 80857 states have internal predecessors, (133401), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-02-05 17:55:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84346 states to 84346 states and 155215 transitions. [2025-02-05 17:55:55,293 INFO L78 Accepts]: Start accepts. Automaton has 84346 states and 155215 transitions. Word has length 179 [2025-02-05 17:55:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:55,293 INFO L471 AbstractCegarLoop]: Abstraction has 84346 states and 155215 transitions. [2025-02-05 17:55:55,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 84346 states and 155215 transitions. [2025-02-05 17:55:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:55:55,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:55,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:55,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 17:55:55,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:55,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1912608884, now seen corresponding path program 1 times [2025-02-05 17:55:55,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:55,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939642678] [2025-02-05 17:55:55,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:55,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:55:55,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:55:55,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:55,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:55,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:55,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939642678] [2025-02-05 17:55:55,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939642678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:55,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:55,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146890228] [2025-02-05 17:55:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:55,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:55,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:55,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:55,522 INFO L87 Difference]: Start difference. First operand 84346 states and 155215 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-02-05 17:55:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:59,588 INFO L93 Difference]: Finished difference Result 201506 states and 386141 transitions. [2025-02-05 17:55:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:59,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:55:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:00,055 INFO L225 Difference]: With dead ends: 201506 [2025-02-05 17:56:00,055 INFO L226 Difference]: Without dead ends: 117181 [2025-02-05 17:56:00,279 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-02-05 17:56:00,280 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 834 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:00,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1234 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117181 states.