./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.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.10.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 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:55:08,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:55:08,392 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:08,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:55:08,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:55:08,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:55:08,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:55:08,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:55:08,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:55:08,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:55:08,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:55:08,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:55:08,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:55:08,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:55:08,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:55:08,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:55:08,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:55:08,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:55:08,414 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 -> 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f [2025-02-05 17:55:08,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:55:08,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:55:08,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:55:08,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:55:08,663 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:55:08,664 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.10.cil-1.c [2025-02-05 17:55:10,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7679fc3dd/f8a0148616f4424fa471f9b0a87b9711/FLAG48e4efb25 [2025-02-05 17:55:10,378 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:55:10,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2025-02-05 17:55:10,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7679fc3dd/f8a0148616f4424fa471f9b0a87b9711/FLAG48e4efb25 [2025-02-05 17:55:10,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7679fc3dd/f8a0148616f4424fa471f9b0a87b9711 [2025-02-05 17:55:10,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:55:10,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:55:10,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:55:10,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:55:10,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:55:10,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:55:10" (1/1) ... [2025-02-05 17:55:10,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfaa67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:10, skipping insertion in model container [2025-02-05 17:55:10,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:55:10" (1/1) ... [2025-02-05 17:55:10,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:55:10,758 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.10.cil-1.c[914,927] [2025-02-05 17:55:10,806 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.10.cil-1.c[7115,7128] [2025-02-05 17:55:10,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:55:10,906 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:55:10,917 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.10.cil-1.c[914,927] [2025-02-05 17:55:10,932 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.10.cil-1.c[7115,7128] [2025-02-05 17:55:10,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:55:11,011 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:55:11,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:11 WrapperNode [2025-02-05 17:55:11,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:55:11,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:55:11,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:55:11,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:55:11,018 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:11" (1/1) ... [2025-02-05 17:55:11,032 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:11" (1/1) ... [2025-02-05 17:55:11,080 INFO L138 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 903 [2025-02-05 17:55:11,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:55:11,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:55:11,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:55:11,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:55:11,095 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:11" (1/1) ... [2025-02-05 17:55:11,096 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:11" (1/1) ... [2025-02-05 17:55:11,101 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:11" (1/1) ... [2025-02-05 17:55:11,121 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:11,122 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:11" (1/1) ... [2025-02-05 17:55:11,122 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:11" (1/1) ... [2025-02-05 17:55:11,129 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:11" (1/1) ... [2025-02-05 17:55:11,133 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:11" (1/1) ... [2025-02-05 17:55:11,135 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:11" (1/1) ... [2025-02-05 17:55:11,136 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:11" (1/1) ... [2025-02-05 17:55:11,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:55:11,139 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:55:11,139 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:55:11,139 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:55:11,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:11" (1/1) ... [2025-02-05 17:55:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:55:11,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:11,176 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:11,179 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:11,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:55:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:55:11,197 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:55:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:55:11,197 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:55:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:55:11,198 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:55:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:55:11,198 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:55:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:55:11,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:55:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:55:11,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:55:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:55:11,198 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:55:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:55:11,198 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:55:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:55:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:55:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:55:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:55:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:55:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:55:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:55:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:55:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:55:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:55:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:55:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:55:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:55:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:55:11,200 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:55:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:55:11,201 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:55:11,311 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:55:11,312 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:55:12,046 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-02-05 17:55:12,046 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:55:12,077 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:55:12,081 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:55:12,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:55:12 BoogieIcfgContainer [2025-02-05 17:55:12,083 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:55:12,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:55:12,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:55:12,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:55:12,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:55:10" (1/3) ... [2025-02-05 17:55:12,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdb217a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:55:12, skipping insertion in model container [2025-02-05 17:55:12,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:11" (2/3) ... [2025-02-05 17:55:12,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdb217a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:55:12, skipping insertion in model container [2025-02-05 17:55:12,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:55:12" (3/3) ... [2025-02-05 17:55:12,092 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2025-02-05 17:55:12,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:55:12,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c that has 16 procedures, 465 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-02-05 17:55:12,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:55:12,181 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;@e9330ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:55:12,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:55:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 466 states, 407 states have (on average 1.5577395577395576) internal successors, (634), 416 states have internal predecessors, (634), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-05 17:55:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:12,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:12,195 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:12,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:12,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1734428172, now seen corresponding path program 1 times [2025-02-05 17:55:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:12,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847302650] [2025-02-05 17:55:12,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:12,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:12,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:12,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:12,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:12,430 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:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847302650] [2025-02-05 17:55:12,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847302650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:12,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:12,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420471935] [2025-02-05 17:55:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:12,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:12,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:12,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:12,456 INFO L87 Difference]: Start difference. First operand has 466 states, 407 states have (on average 1.5577395577395576) internal successors, (634), 416 states have internal predecessors, (634), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) 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:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:12,561 INFO L93 Difference]: Finished difference Result 906 states and 1385 transitions. [2025-02-05 17:55:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:12,564 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:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:12,580 INFO L225 Difference]: With dead ends: 906 [2025-02-05 17:55:12,580 INFO L226 Difference]: Without dead ends: 454 [2025-02-05 17:55:12,591 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:12,596 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 133 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1239 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:12,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1239 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:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-05 17:55:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-02-05 17:55:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 404 states have internal predecessors, (603), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 17:55:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 679 transitions. [2025-02-05 17:55:12,660 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 679 transitions. Word has length 65 [2025-02-05 17:55:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:12,661 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 679 transitions. [2025-02-05 17:55:12,662 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:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 679 transitions. [2025-02-05 17:55:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:12,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:12,666 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:12,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:55:12,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:12,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1714090797, now seen corresponding path program 1 times [2025-02-05 17:55:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588674057] [2025-02-05 17:55:12,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:12,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:12,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:12,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:12,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:12,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:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588674057] [2025-02-05 17:55:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588674057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:12,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:12,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:12,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517908343] [2025-02-05 17:55:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:12,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:12,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:12,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:12,929 INFO L87 Difference]: Start difference. First operand 454 states and 679 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:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:13,933 INFO L93 Difference]: Finished difference Result 649 states and 949 transitions. [2025-02-05 17:55:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:13,934 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:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:13,938 INFO L225 Difference]: With dead ends: 649 [2025-02-05 17:55:13,938 INFO L226 Difference]: Without dead ends: 559 [2025-02-05 17:55:13,938 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:13,939 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 436 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:13,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1474 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:55:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-05 17:55:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 552. [2025-02-05 17:55:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 477 states have (on average 1.4842767295597483) internal successors, (708), 484 states have internal predecessors, (708), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2025-02-05 17:55:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 811 transitions. [2025-02-05 17:55:13,964 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 811 transitions. Word has length 65 [2025-02-05 17:55:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:13,965 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 811 transitions. [2025-02-05 17:55:13,965 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:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 811 transitions. [2025-02-05 17:55:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:13,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:13,967 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:13,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:55:13,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:13,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 278750826, now seen corresponding path program 1 times [2025-02-05 17:55:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558888621] [2025-02-05 17:55:13,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:13,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:13,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:13,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:13,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:14,121 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:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558888621] [2025-02-05 17:55:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558888621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:14,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:14,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:14,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470937858] [2025-02-05 17:55:14,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:14,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:14,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:14,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:14,123 INFO L87 Difference]: Start difference. First operand 552 states and 811 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:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:14,842 INFO L93 Difference]: Finished difference Result 875 states and 1244 transitions. [2025-02-05 17:55:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:14,843 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:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:14,847 INFO L225 Difference]: With dead ends: 875 [2025-02-05 17:55:14,847 INFO L226 Difference]: Without dead ends: 694 [2025-02-05 17:55:14,848 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:14,848 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 992 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:14,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 1704 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-02-05 17:55:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 650. [2025-02-05 17:55:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 555 states have (on average 1.463063063063063) internal successors, (812), 564 states have internal predecessors, (812), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2025-02-05 17:55:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 945 transitions. [2025-02-05 17:55:14,888 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 945 transitions. Word has length 65 [2025-02-05 17:55:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:14,889 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 945 transitions. [2025-02-05 17:55:14,889 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:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 945 transitions. [2025-02-05 17:55:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:14,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:14,891 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:14,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:55:14,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:14,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1411941419, now seen corresponding path program 1 times [2025-02-05 17:55:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:14,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901285372] [2025-02-05 17:55:14,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:14,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:14,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:14,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:14,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:14,978 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:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901285372] [2025-02-05 17:55:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901285372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611467514] [2025-02-05 17:55:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:14,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:14,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:14,980 INFO L87 Difference]: Start difference. First operand 650 states and 945 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:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:15,030 INFO L93 Difference]: Finished difference Result 928 states and 1321 transitions. [2025-02-05 17:55:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:15,030 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:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:15,033 INFO L225 Difference]: With dead ends: 928 [2025-02-05 17:55:15,033 INFO L226 Difference]: Without dead ends: 655 [2025-02-05 17:55:15,034 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:15,035 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3375 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:15,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3375 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:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-05 17:55:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2025-02-05 17:55:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 559 states have (on average 1.4561717352415027) internal successors, (814), 568 states have internal predecessors, (814), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2025-02-05 17:55:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 948 transitions. [2025-02-05 17:55:15,069 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 948 transitions. Word has length 65 [2025-02-05 17:55:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:15,069 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 948 transitions. [2025-02-05 17:55:15,069 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:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 948 transitions. [2025-02-05 17:55:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:15,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:15,071 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:15,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:55:15,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:15,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1250221878, now seen corresponding path program 1 times [2025-02-05 17:55:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:15,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663642106] [2025-02-05 17:55:15,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:15,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:15,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:15,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:15,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:15,153 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:15,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:15,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663642106] [2025-02-05 17:55:15,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663642106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:15,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:15,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:55:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377322555] [2025-02-05 17:55:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:15,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:55:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:15,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:55:15,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:55:15,155 INFO L87 Difference]: Start difference. First operand 655 states and 948 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:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:16,151 INFO L93 Difference]: Finished difference Result 1923 states and 2652 transitions. [2025-02-05 17:55:16,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:55:16,153 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:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:16,162 INFO L225 Difference]: With dead ends: 1923 [2025-02-05 17:55:16,163 INFO L226 Difference]: Without dead ends: 1627 [2025-02-05 17:55:16,165 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:16,167 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 2936 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2950 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:16,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2950 Valid, 1872 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:55:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2025-02-05 17:55:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1573. [2025-02-05 17:55:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1291 states have (on average 1.3617350890782338) internal successors, (1758), 1315 states have internal predecessors, (1758), 150 states have call successors, (150), 112 states have call predecessors, (150), 130 states have return successors, (186), 148 states have call predecessors, (186), 146 states have call successors, (186) [2025-02-05 17:55:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2094 transitions. [2025-02-05 17:55:16,262 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2094 transitions. Word has length 65 [2025-02-05 17:55:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:16,263 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2094 transitions. [2025-02-05 17:55:16,263 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:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2094 transitions. [2025-02-05 17:55:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:16,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:16,265 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:16,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:55:16,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:16,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:16,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1595483638, now seen corresponding path program 1 times [2025-02-05 17:55:16,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:16,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656037399] [2025-02-05 17:55:16,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:16,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:16,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:16,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:16,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:16,363 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:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656037399] [2025-02-05 17:55:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656037399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:16,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177129079] [2025-02-05 17:55:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:16,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:16,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:16,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:16,365 INFO L87 Difference]: Start difference. First operand 1573 states and 2094 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:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:16,438 INFO L93 Difference]: Finished difference Result 2811 states and 3678 transitions. [2025-02-05 17:55:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:16,438 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:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:16,444 INFO L225 Difference]: With dead ends: 2811 [2025-02-05 17:55:16,445 INFO L226 Difference]: Without dead ends: 1603 [2025-02-05 17:55:16,446 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:16,447 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3375 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:16,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3375 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:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-02-05 17:55:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-02-05 17:55:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1315 states have (on average 1.3490494296577946) internal successors, (1774), 1339 states have internal predecessors, (1774), 150 states have call successors, (150), 112 states have call predecessors, (150), 136 states have return successors, (192), 154 states have call predecessors, (192), 146 states have call successors, (192) [2025-02-05 17:55:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2116 transitions. [2025-02-05 17:55:16,519 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2116 transitions. Word has length 66 [2025-02-05 17:55:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:16,520 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2116 transitions. [2025-02-05 17:55:16,520 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:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2116 transitions. [2025-02-05 17:55:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:16,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:16,521 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:16,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:55:16,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:16,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1584167511, now seen corresponding path program 1 times [2025-02-05 17:55:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590284729] [2025-02-05 17:55:16,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:16,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:16,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:16,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:16,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590284729] [2025-02-05 17:55:16,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590284729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:16,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202853737] [2025-02-05 17:55:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:16,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:16,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:16,648 INFO L87 Difference]: Start difference. First operand 1603 states and 2116 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:17,370 INFO L93 Difference]: Finished difference Result 2835 states and 3619 transitions. [2025-02-05 17:55:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:55:17,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2025-02-05 17:55:17,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:17,378 INFO L225 Difference]: With dead ends: 2835 [2025-02-05 17:55:17,378 INFO L226 Difference]: Without dead ends: 1825 [2025-02-05 17:55:17,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:55:17,381 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 977 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:17,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1491 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2025-02-05 17:55:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1544. [2025-02-05 17:55:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1272 states have (on average 1.346698113207547) internal successors, (1713), 1291 states have internal predecessors, (1713), 144 states have call successors, (144), 107 states have call predecessors, (144), 126 states have return successors, (177), 147 states have call predecessors, (177), 140 states have call successors, (177) [2025-02-05 17:55:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2034 transitions. [2025-02-05 17:55:17,453 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2034 transitions. Word has length 66 [2025-02-05 17:55:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:17,453 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2034 transitions. [2025-02-05 17:55:17,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2034 transitions. [2025-02-05 17:55:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:17,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:17,454 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:17,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:55:17,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:17,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:17,455 INFO L85 PathProgramCache]: Analyzing trace with hash 633590442, now seen corresponding path program 1 times [2025-02-05 17:55:17,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:17,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100331382] [2025-02-05 17:55:17,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:17,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:17,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:17,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:17,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:17,509 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:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100331382] [2025-02-05 17:55:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100331382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:55:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169934742] [2025-02-05 17:55:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:17,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:55:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:17,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:55:17,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:55:17,513 INFO L87 Difference]: Start difference. First operand 1544 states and 2034 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:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:18,022 INFO L93 Difference]: Finished difference Result 3790 states and 4868 transitions. [2025-02-05 17:55:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:55:18,023 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:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:18,031 INFO L225 Difference]: With dead ends: 3790 [2025-02-05 17:55:18,031 INFO L226 Difference]: Without dead ends: 2612 [2025-02-05 17:55:18,033 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:18,034 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 936 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:18,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 763 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:55:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2025-02-05 17:55:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2608. [2025-02-05 17:55:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2096 states have (on average 1.2919847328244274) internal successors, (2708), 2131 states have internal predecessors, (2708), 260 states have call successors, (260), 206 states have call predecessors, (260), 250 states have return successors, (365), 272 states have call predecessors, (365), 256 states have call successors, (365) [2025-02-05 17:55:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 3333 transitions. [2025-02-05 17:55:18,178 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 3333 transitions. Word has length 66 [2025-02-05 17:55:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:18,178 INFO L471 AbstractCegarLoop]: Abstraction has 2608 states and 3333 transitions. [2025-02-05 17:55:18,178 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:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3333 transitions. [2025-02-05 17:55:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:55:18,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:18,179 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:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:55:18,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:18,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2024995998, now seen corresponding path program 1 times [2025-02-05 17:55:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:18,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560114492] [2025-02-05 17:55:18,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:18,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:55:18,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:55:18,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:18,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:18,207 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:18,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560114492] [2025-02-05 17:55:18,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560114492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:18,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:18,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445116195] [2025-02-05 17:55:18,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:18,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:18,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:18,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:18,209 INFO L87 Difference]: Start difference. First operand 2608 states and 3333 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:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:18,328 INFO L93 Difference]: Finished difference Result 5707 states and 7197 transitions. [2025-02-05 17:55:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:18,328 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:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:18,340 INFO L225 Difference]: With dead ends: 5707 [2025-02-05 17:55:18,340 INFO L226 Difference]: Without dead ends: 3429 [2025-02-05 17:55:18,344 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:18,344 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 101 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1342 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:18,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1342 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:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2025-02-05 17:55:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3367. [2025-02-05 17:55:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3367 states, 2684 states have (on average 1.2768256333830104) internal successors, (3427), 2724 states have internal predecessors, (3427), 344 states have call successors, (344), 279 states have call predecessors, (344), 337 states have return successors, (469), 365 states have call predecessors, (469), 340 states have call successors, (469) [2025-02-05 17:55:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 3367 states and 4240 transitions. [2025-02-05 17:55:18,519 INFO L78 Accepts]: Start accepts. Automaton has 3367 states and 4240 transitions. Word has length 67 [2025-02-05 17:55:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:18,519 INFO L471 AbstractCegarLoop]: Abstraction has 3367 states and 4240 transitions. [2025-02-05 17:55:18,520 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:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 4240 transitions. [2025-02-05 17:55:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 17:55:18,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:18,520 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:18,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:55:18,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:18,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 163403966, now seen corresponding path program 1 times [2025-02-05 17:55:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251199427] [2025-02-05 17:55:18,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:18,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:55:18,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:55:18,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:18,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:18,545 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:18,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251199427] [2025-02-05 17:55:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251199427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690909977] [2025-02-05 17:55:18,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:18,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:18,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:18,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:18,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:18,546 INFO L87 Difference]: Start difference. First operand 3367 states and 4240 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:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:18,589 INFO L93 Difference]: Finished difference Result 3717 states and 4659 transitions. [2025-02-05 17:55:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:18,590 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:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:18,595 INFO L225 Difference]: With dead ends: 3717 [2025-02-05 17:55:18,595 INFO L226 Difference]: Without dead ends: 711 [2025-02-05 17:55:18,599 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:18,599 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 639 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 657 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:18,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 657 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:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-02-05 17:55:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 667. [2025-02-05 17:55:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 559 states have (on average 1.3756708407871199) internal successors, (769), 566 states have internal predecessors, (769), 66 states have call successors, (66), 38 states have call predecessors, (66), 40 states have return successors, (66), 64 states have call predecessors, (66), 62 states have call successors, (66) [2025-02-05 17:55:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 901 transitions. [2025-02-05 17:55:18,624 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 901 transitions. Word has length 73 [2025-02-05 17:55:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:18,625 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 901 transitions. [2025-02-05 17:55:18,625 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:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 901 transitions. [2025-02-05 17:55:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:55:18,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:18,628 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:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:55:18,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1940907630, now seen corresponding path program 1 times [2025-02-05 17:55:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679853504] [2025-02-05 17:55:18,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:18,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:55:18,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:55:18,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:18,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:18,718 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:18,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:18,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679853504] [2025-02-05 17:55:18,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679853504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013711193] [2025-02-05 17:55:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:18,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:18,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:18,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:18,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:18,720 INFO L87 Difference]: Start difference. First operand 667 states and 901 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:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:19,425 INFO L93 Difference]: Finished difference Result 1268 states and 1578 transitions. [2025-02-05 17:55:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 17:55:19,426 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:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:19,431 INFO L225 Difference]: With dead ends: 1268 [2025-02-05 17:55:19,431 INFO L226 Difference]: Without dead ends: 904 [2025-02-05 17:55:19,432 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:19,432 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 597 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:19,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1815 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-02-05 17:55:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 864. [2025-02-05 17:55:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 707 states have (on average 1.3182461103253182) internal successors, (932), 715 states have internal predecessors, (932), 90 states have call successors, (90), 59 states have call predecessors, (90), 65 states have return successors, (97), 91 states have call predecessors, (97), 86 states have call successors, (97) [2025-02-05 17:55:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1119 transitions. [2025-02-05 17:55:19,469 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1119 transitions. Word has length 84 [2025-02-05 17:55:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:19,469 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1119 transitions. [2025-02-05 17:55:19,470 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:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1119 transitions. [2025-02-05 17:55:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:55:19,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:19,472 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:19,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:55:19,473 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:19,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash -440687687, now seen corresponding path program 1 times [2025-02-05 17:55:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337484394] [2025-02-05 17:55:19,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:19,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:55:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:55:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:19,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:19,598 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:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:19,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337484394] [2025-02-05 17:55:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337484394] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:55:19,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424513325] [2025-02-05 17:55:19,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:19,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:55:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:19,602 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:19,606 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:19,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:55:19,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:55:19,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:19,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:19,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 17:55:19,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:55:19,810 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:19,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:55:19,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424513325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:19,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:55:19,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 17:55:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005165779] [2025-02-05 17:55:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:19,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:19,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:19,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:55:19,816 INFO L87 Difference]: Start difference. First operand 864 states and 1119 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:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:19,854 INFO L93 Difference]: Finished difference Result 928 states and 1182 transitions. [2025-02-05 17:55:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:19,854 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:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:19,858 INFO L225 Difference]: With dead ends: 928 [2025-02-05 17:55:19,858 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 17:55:19,859 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:19,860 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 0 mSDsluCounter, 2430 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3039 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:19,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3039 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:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 17:55:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-02-05 17:55:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 324 states have (on average 1.537037037037037) internal successors, (498), 326 states have internal predecessors, (498), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 17:55:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2025-02-05 17:55:19,874 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 145 [2025-02-05 17:55:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:19,874 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2025-02-05 17:55:19,875 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:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2025-02-05 17:55:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:19,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:19,877 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] [2025-02-05 17:55:19,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:55:20,078 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,SelfDestructingSolverStorable11 [2025-02-05 17:55:20,079 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1003251979, now seen corresponding path program 1 times [2025-02-05 17:55:20,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:20,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023684775] [2025-02-05 17:55:20,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:20,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:20,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:20,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:20,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:20,202 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:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:20,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023684775] [2025-02-05 17:55:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023684775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:20,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:20,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:20,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40779036] [2025-02-05 17:55:20,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:20,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:20,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:20,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:20,204 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:20,672 INFO L93 Difference]: Finished difference Result 1073 states and 1662 transitions. [2025-02-05 17:55:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:20,677 INFO L225 Difference]: With dead ends: 1073 [2025-02-05 17:55:20,677 INFO L226 Difference]: Without dead ends: 735 [2025-02-05 17:55:20,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:20,679 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 1018 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:20,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1541 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:55:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-02-05 17:55:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 708. [2025-02-05 17:55:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 652 states have internal predecessors, (1004), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:55:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1093 transitions. [2025-02-05 17:55:20,709 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1093 transitions. Word has length 157 [2025-02-05 17:55:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:20,710 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1093 transitions. [2025-02-05 17:55:20,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1093 transitions. [2025-02-05 17:55:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:20,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:20,712 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] [2025-02-05 17:55:20,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:55:20,712 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:20,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash -811214071, now seen corresponding path program 1 times [2025-02-05 17:55:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081224844] [2025-02-05 17:55:20,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:20,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:20,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:20,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:20,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:20,924 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:20,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081224844] [2025-02-05 17:55:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081224844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55490177] [2025-02-05 17:55:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:20,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:20,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:20,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:20,927 INFO L87 Difference]: Start difference. First operand 708 states and 1093 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:21,584 INFO L93 Difference]: Finished difference Result 1840 states and 2873 transitions. [2025-02-05 17:55:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:21,589 INFO L225 Difference]: With dead ends: 1840 [2025-02-05 17:55:21,589 INFO L226 Difference]: Without dead ends: 1151 [2025-02-05 17:55:21,591 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:21,591 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 1023 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:21,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 3003 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-02-05 17:55:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1036. [2025-02-05 17:55:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 951 states have (on average 1.5394321766561514) internal successors, (1464), 955 states have internal predecessors, (1464), 64 states have call successors, (64), 19 states have call predecessors, (64), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-02-05 17:55:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1594 transitions. [2025-02-05 17:55:21,630 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1594 transitions. Word has length 157 [2025-02-05 17:55:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:21,630 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1594 transitions. [2025-02-05 17:55:21,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1594 transitions. [2025-02-05 17:55:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:21,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:21,631 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] [2025-02-05 17:55:21,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:55:21,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:21,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2035746378, now seen corresponding path program 1 times [2025-02-05 17:55:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:21,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004748644] [2025-02-05 17:55:21,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:21,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:21,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:21,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:21,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:21,747 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:21,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:21,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004748644] [2025-02-05 17:55:21,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004748644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:21,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:21,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667777543] [2025-02-05 17:55:21,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:21,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:21,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:21,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:21,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:21,749 INFO L87 Difference]: Start difference. First operand 1036 states and 1594 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:22,387 INFO L93 Difference]: Finished difference Result 2882 states and 4491 transitions. [2025-02-05 17:55:22,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:22,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:22,395 INFO L225 Difference]: With dead ends: 2882 [2025-02-05 17:55:22,395 INFO L226 Difference]: Without dead ends: 1865 [2025-02-05 17:55:22,398 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:22,398 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 1018 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:22,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 2987 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2025-02-05 17:55:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1733. [2025-02-05 17:55:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1594 states have (on average 1.5426599749058971) internal successors, (2459), 1602 states have internal predecessors, (2459), 102 states have call successors, (102), 31 states have call predecessors, (102), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-02-05 17:55:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2677 transitions. [2025-02-05 17:55:22,448 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2677 transitions. Word has length 157 [2025-02-05 17:55:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:22,448 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2677 transitions. [2025-02-05 17:55:22,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2677 transitions. [2025-02-05 17:55:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:22,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:22,450 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] [2025-02-05 17:55:22,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:55:22,451 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:22,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash -920457495, now seen corresponding path program 1 times [2025-02-05 17:55:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:22,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404884922] [2025-02-05 17:55:22,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:22,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:22,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:22,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:22,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:22,577 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:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404884922] [2025-02-05 17:55:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404884922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161792335] [2025-02-05 17:55:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:22,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:22,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:22,580 INFO L87 Difference]: Start difference. First operand 1733 states and 2677 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:23,211 INFO L93 Difference]: Finished difference Result 5125 states and 8048 transitions. [2025-02-05 17:55:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:23,223 INFO L225 Difference]: With dead ends: 5125 [2025-02-05 17:55:23,223 INFO L226 Difference]: Without dead ends: 3411 [2025-02-05 17:55:23,228 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:23,229 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 1013 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 2975 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:23,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 2975 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:55:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2025-02-05 17:55:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 3244. [2025-02-05 17:55:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 2991 states have (on average 1.5590103644266131) internal successors, (4663), 3013 states have internal predecessors, (4663), 178 states have call successors, (178), 55 states have call predecessors, (178), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-02-05 17:55:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 5081 transitions. [2025-02-05 17:55:23,374 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 5081 transitions. Word has length 157 [2025-02-05 17:55:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:23,374 INFO L471 AbstractCegarLoop]: Abstraction has 3244 states and 5081 transitions. [2025-02-05 17:55:23,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 5081 transitions. [2025-02-05 17:55:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:23,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:23,376 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] [2025-02-05 17:55:23,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:55:23,376 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:23,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash -738724246, now seen corresponding path program 1 times [2025-02-05 17:55:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474554785] [2025-02-05 17:55:23,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:23,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:23,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:23,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:23,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:23,471 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:23,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474554785] [2025-02-05 17:55:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474554785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973039850] [2025-02-05 17:55:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:23,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:23,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:23,473 INFO L87 Difference]: Start difference. First operand 3244 states and 5081 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:24,141 INFO L93 Difference]: Finished difference Result 10060 states and 16102 transitions. [2025-02-05 17:55:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:24,168 INFO L225 Difference]: With dead ends: 10060 [2025-02-05 17:55:24,168 INFO L226 Difference]: Without dead ends: 6835 [2025-02-05 17:55:24,176 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:24,177 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 1008 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 2963 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:24,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 2963 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:55:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2025-02-05 17:55:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6599. [2025-02-05 17:55:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 6100 states have (on average 1.5867213114754097) internal successors, (9679), 6168 states have internal predecessors, (9679), 330 states have call successors, (330), 103 states have call predecessors, (330), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-02-05 17:55:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 10593 transitions. [2025-02-05 17:55:24,402 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 10593 transitions. Word has length 157 [2025-02-05 17:55:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:24,402 INFO L471 AbstractCegarLoop]: Abstraction has 6599 states and 10593 transitions. [2025-02-05 17:55:24,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 10593 transitions. [2025-02-05 17:55:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:24,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:24,407 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] [2025-02-05 17:55:24,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:55:24,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:24,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash -594314551, now seen corresponding path program 1 times [2025-02-05 17:55:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:24,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555491006] [2025-02-05 17:55:24,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:24,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:24,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:24,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:24,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:24,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:24,519 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,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555491006] [2025-02-05 17:55:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555491006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:24,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:24,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306379460] [2025-02-05 17:55:24,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:24,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:24,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:24,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:24,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:24,520 INFO L87 Difference]: Start difference. First operand 6599 states and 10593 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:24,910 INFO L93 Difference]: Finished difference Result 14673 states and 24185 transitions. [2025-02-05 17:55:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:24,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:24,939 INFO L225 Difference]: With dead ends: 14673 [2025-02-05 17:55:24,939 INFO L226 Difference]: Without dead ends: 8093 [2025-02-05 17:55:25,019 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:25,020 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 727 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:25,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1100 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:55:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8093 states. [2025-02-05 17:55:25,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8093 to 6599. [2025-02-05 17:55:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 6100 states have (on average 1.5839344262295083) internal successors, (9662), 6168 states have internal predecessors, (9662), 330 states have call successors, (330), 103 states have call predecessors, (330), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-02-05 17:55:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 10576 transitions. [2025-02-05 17:55:25,215 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 10576 transitions. Word has length 157 [2025-02-05 17:55:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:25,215 INFO L471 AbstractCegarLoop]: Abstraction has 6599 states and 10576 transitions. [2025-02-05 17:55:25,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 10576 transitions. [2025-02-05 17:55:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:25,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:25,218 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] [2025-02-05 17:55:25,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:55:25,219 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:25,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash -866750838, now seen corresponding path program 1 times [2025-02-05 17:55:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:25,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038979481] [2025-02-05 17:55:25,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:25,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:25,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:25,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:25,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:25,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:25,315 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,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:25,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038979481] [2025-02-05 17:55:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038979481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327838568] [2025-02-05 17:55:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:25,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:25,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:25,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:25,317 INFO L87 Difference]: Start difference. First operand 6599 states and 10576 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:25,838 INFO L93 Difference]: Finished difference Result 14590 states and 23985 transitions. [2025-02-05 17:55:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:25,868 INFO L225 Difference]: With dead ends: 14590 [2025-02-05 17:55:25,868 INFO L226 Difference]: Without dead ends: 8010 [2025-02-05 17:55:25,886 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:25,887 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 724 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:25,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1092 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:55:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8010 states. [2025-02-05 17:55:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8010 to 6599. [2025-02-05 17:55:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 6100 states have (on average 1.5811475409836067) internal successors, (9645), 6168 states have internal predecessors, (9645), 330 states have call successors, (330), 103 states have call predecessors, (330), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-02-05 17:55:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 10559 transitions. [2025-02-05 17:55:26,208 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 10559 transitions. Word has length 157 [2025-02-05 17:55:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:26,208 INFO L471 AbstractCegarLoop]: Abstraction has 6599 states and 10559 transitions. [2025-02-05 17:55:26,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 10559 transitions. [2025-02-05 17:55:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:26,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:26,211 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] [2025-02-05 17:55:26,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:55:26,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:26,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1618312873, now seen corresponding path program 1 times [2025-02-05 17:55:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:26,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143775839] [2025-02-05 17:55:26,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:26,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:26,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:26,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:26,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:26,311 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,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143775839] [2025-02-05 17:55:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143775839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:26,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651699566] [2025-02-05 17:55:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:26,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:26,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:26,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:26,314 INFO L87 Difference]: Start difference. First operand 6599 states and 10559 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:26,751 INFO L93 Difference]: Finished difference Result 14507 states and 23785 transitions. [2025-02-05 17:55:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:26,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:26,776 INFO L225 Difference]: With dead ends: 14507 [2025-02-05 17:55:26,776 INFO L226 Difference]: Without dead ends: 7927 [2025-02-05 17:55:26,790 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:26,791 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 721 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:26,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1084 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:55:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2025-02-05 17:55:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 6599. [2025-02-05 17:55:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 6100 states have (on average 1.578360655737705) internal successors, (9628), 6168 states have internal predecessors, (9628), 330 states have call successors, (330), 103 states have call predecessors, (330), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-02-05 17:55:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 10542 transitions. [2025-02-05 17:55:26,991 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 10542 transitions. Word has length 157 [2025-02-05 17:55:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:26,991 INFO L471 AbstractCegarLoop]: Abstraction has 6599 states and 10542 transitions. [2025-02-05 17:55:26,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 10542 transitions. [2025-02-05 17:55:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:26,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:26,995 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] [2025-02-05 17:55:26,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:55:26,995 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:26,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1144286890, now seen corresponding path program 1 times [2025-02-05 17:55:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289459793] [2025-02-05 17:55:26,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:27,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:27,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:27,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:27,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:27,103 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,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:27,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289459793] [2025-02-05 17:55:27,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289459793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:27,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:27,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769426059] [2025-02-05 17:55:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:27,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:27,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:27,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:27,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:27,105 INFO L87 Difference]: Start difference. First operand 6599 states and 10542 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:27,983 INFO L93 Difference]: Finished difference Result 20903 states and 34255 transitions. [2025-02-05 17:55:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:28,032 INFO L225 Difference]: With dead ends: 20903 [2025-02-05 17:55:28,032 INFO L226 Difference]: Without dead ends: 14323 [2025-02-05 17:55:28,050 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:28,051 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 979 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:28,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 2894 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:55:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14323 states. [2025-02-05 17:55:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14323 to 14011. [2025-02-05 17:55:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14011 states, 12966 states have (on average 1.607743328705846) internal successors, (20846), 13180 states have internal predecessors, (20846), 634 states have call successors, (634), 199 states have call predecessors, (634), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:55:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14011 states to 14011 states and 23136 transitions. [2025-02-05 17:55:28,510 INFO L78 Accepts]: Start accepts. Automaton has 14011 states and 23136 transitions. Word has length 157 [2025-02-05 17:55:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:28,511 INFO L471 AbstractCegarLoop]: Abstraction has 14011 states and 23136 transitions. [2025-02-05 17:55:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 14011 states and 23136 transitions. [2025-02-05 17:55:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:28,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:28,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:55:28,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 851901065, now seen corresponding path program 1 times [2025-02-05 17:55:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:28,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392423] [2025-02-05 17:55:28,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:28,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:28,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:28,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:28,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:28,601 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,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392423] [2025-02-05 17:55:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:28,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267943371] [2025-02-05 17:55:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:28,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:28,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:28,603 INFO L87 Difference]: Start difference. First operand 14011 states and 23136 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:29,508 INFO L93 Difference]: Finished difference Result 31433 states and 53457 transitions. [2025-02-05 17:55:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:29,571 INFO L225 Difference]: With dead ends: 31433 [2025-02-05 17:55:29,572 INFO L226 Difference]: Without dead ends: 17441 [2025-02-05 17:55:29,607 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:29,609 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 717 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:29,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1070 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:55:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-02-05 17:55:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 14011. [2025-02-05 17:55:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14011 states, 12966 states have (on average 1.6051982107049205) internal successors, (20813), 13180 states have internal predecessors, (20813), 634 states have call successors, (634), 199 states have call predecessors, (634), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:55:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14011 states to 14011 states and 23103 transitions. [2025-02-05 17:55:30,337 INFO L78 Accepts]: Start accepts. Automaton has 14011 states and 23103 transitions. Word has length 157 [2025-02-05 17:55:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:30,337 INFO L471 AbstractCegarLoop]: Abstraction has 14011 states and 23103 transitions. [2025-02-05 17:55:30,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 14011 states and 23103 transitions. [2025-02-05 17:55:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:30,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:30,342 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] [2025-02-05 17:55:30,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:55:30,342 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:30,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1512835382, now seen corresponding path program 1 times [2025-02-05 17:55:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553479582] [2025-02-05 17:55:30,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:30,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:30,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:30,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:30,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:30,440 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,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:30,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553479582] [2025-02-05 17:55:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553479582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:30,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17298343] [2025-02-05 17:55:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:30,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:30,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:30,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:30,441 INFO L87 Difference]: Start difference. First operand 14011 states and 23103 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:31,744 INFO L93 Difference]: Finished difference Result 45253 states and 77200 transitions. [2025-02-05 17:55:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:31,837 INFO L225 Difference]: With dead ends: 45253 [2025-02-05 17:55:31,837 INFO L226 Difference]: Without dead ends: 31261 [2025-02-05 17:55:31,869 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:31,870 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 966 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 2863 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:31,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 2863 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:55:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31261 states. [2025-02-05 17:55:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31261 to 30779. [2025-02-05 17:55:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30779 states, 28480 states have (on average 1.6363412921348315) internal successors, (46603), 29148 states have internal predecessors, (46603), 1242 states have call successors, (1242), 391 states have call predecessors, (1242), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:55:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30779 states to 30779 states and 53181 transitions. [2025-02-05 17:55:32,971 INFO L78 Accepts]: Start accepts. Automaton has 30779 states and 53181 transitions. Word has length 157 [2025-02-05 17:55:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:32,971 INFO L471 AbstractCegarLoop]: Abstraction has 30779 states and 53181 transitions. [2025-02-05 17:55:32,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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,971 INFO L276 IsEmpty]: Start isEmpty. Operand 30779 states and 53181 transitions. [2025-02-05 17:55:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:33,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:33,134 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] [2025-02-05 17:55:33,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 17:55:33,134 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:33,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1727664535, now seen corresponding path program 1 times [2025-02-05 17:55:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80238] [2025-02-05 17:55:33,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:33,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:33,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:33,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:33,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:33,264 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,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80238] [2025-02-05 17:55:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:33,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:33,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:33,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883836395] [2025-02-05 17:55:33,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:33,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:33,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:33,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:33,266 INFO L87 Difference]: Start difference. First operand 30779 states and 53181 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:36,666 INFO L93 Difference]: Finished difference Result 106295 states and 191325 transitions. [2025-02-05 17:55:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:36,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:36,917 INFO L225 Difference]: With dead ends: 106295 [2025-02-05 17:55:36,918 INFO L226 Difference]: Without dead ends: 75535 [2025-02-05 17:55:36,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:55:36,995 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 1275 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 2838 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:36,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 2838 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75535 states. [2025-02-05 17:55:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75535 to 69712. [2025-02-05 17:55:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69712 states, 64483 states have (on average 1.670874494052696) internal successors, (107743), 66545 states have internal predecessors, (107743), 2394 states have call successors, (2394), 775 states have call predecessors, (2394), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:55:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69712 states to 69712 states and 128913 transitions. [2025-02-05 17:55:41,101 INFO L78 Accepts]: Start accepts. Automaton has 69712 states and 128913 transitions. Word has length 157 [2025-02-05 17:55:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:41,101 INFO L471 AbstractCegarLoop]: Abstraction has 69712 states and 128913 transitions. [2025-02-05 17:55:41,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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,102 INFO L276 IsEmpty]: Start isEmpty. Operand 69712 states and 128913 transitions. [2025-02-05 17:55:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:55:41,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:41,120 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] [2025-02-05 17:55:41,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 17:55:41,120 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:41,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:41,121 INFO L85 PathProgramCache]: Analyzing trace with hash 66520810, now seen corresponding path program 1 times [2025-02-05 17:55:41,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:41,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685815944] [2025-02-05 17:55:41,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:41,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:55:41,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:55:41,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:41,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:41,212 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,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685815944] [2025-02-05 17:55:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685815944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:41,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241794583] [2025-02-05 17:55:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:41,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:41,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:41,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:41,213 INFO L87 Difference]: Start difference. First operand 69712 states and 128913 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:48,073 INFO L93 Difference]: Finished difference Result 242816 states and 476439 transitions. [2025-02-05 17:55:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:48,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:55:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:49,233 INFO L225 Difference]: With dead ends: 242816 [2025-02-05 17:55:49,233 INFO L226 Difference]: Without dead ends: 173123 [2025-02-05 17:55:49,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:55:49,587 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1239 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:49,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2822 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173123 states.