./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.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_3.cil+token_ring.03.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 bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:56:20,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:56:20,713 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:56:20,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:56:20,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:56:20,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:56:20,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:56:20,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:56:20,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:56:20,736 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:56:20,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:56:20,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:56:20,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:56:20,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:56:20,736 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:56:20,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:56:20,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:56:20,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:56:20,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:56:20,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:56:20,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:56:20,738 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 -> bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 [2025-02-05 17:56:21,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:56:21,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:56:21,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:56:21,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:56:21,078 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:56:21,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2025-02-05 17:56:22,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1703025d8/a347176a8368438ab22746a24dd4fa4c/FLAGf09b94446 [2025-02-05 17:56:22,702 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:56:22,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2025-02-05 17:56:22,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1703025d8/a347176a8368438ab22746a24dd4fa4c/FLAGf09b94446 [2025-02-05 17:56:22,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1703025d8/a347176a8368438ab22746a24dd4fa4c [2025-02-05 17:56:22,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:56:22,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:56:22,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:56:22,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:56:22,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:56:22,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:56:22" (1/1) ... [2025-02-05 17:56:22,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260b0bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:22, skipping insertion in model container [2025-02-05 17:56:22,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:56:22" (1/1) ... [2025-02-05 17:56:22,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:56:22,954 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_3.cil+token_ring.03.cil-1.c[911,924] [2025-02-05 17:56:23,032 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_3.cil+token_ring.03.cil-1.c[8416,8429] [2025-02-05 17:56:23,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:56:23,111 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:56:23,121 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_3.cil+token_ring.03.cil-1.c[911,924] [2025-02-05 17:56:23,139 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_3.cil+token_ring.03.cil-1.c[8416,8429] [2025-02-05 17:56:23,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:56:23,181 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:56:23,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23 WrapperNode [2025-02-05 17:56:23,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:56:23,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:56:23,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:56:23,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:56:23,189 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:56:23" (1/1) ... [2025-02-05 17:56:23,199 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:56:23" (1/1) ... [2025-02-05 17:56:23,222 INFO L138 Inliner]: procedures = 61, calls = 71, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 542 [2025-02-05 17:56:23,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:56:23,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:56:23,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:56:23,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:56:23,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,247 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:56:23,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,253 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:56:23,259 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:56:23,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:56:23,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:56:23,259 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (1/1) ... [2025-02-05 17:56:23,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:56:23,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:56:23,289 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:56:23,296 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:56:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:56:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:56:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:56:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:56:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:56:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:56:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:56:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:56:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:56:23,381 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:56:23,383 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:56:23,824 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-02-05 17:56:23,824 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-02-05 17:56:23,825 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-02-05 17:56:23,887 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-02-05 17:56:23,888 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:56:23,903 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:56:23,903 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:56:23,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:56:23 BoogieIcfgContainer [2025-02-05 17:56:23,904 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:56:23,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:56:23,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:56:23,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:56:23,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:56:22" (1/3) ... [2025-02-05 17:56:23,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e53fd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:56:23, skipping insertion in model container [2025-02-05 17:56:23,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:23" (2/3) ... [2025-02-05 17:56:23,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e53fd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:56:23, skipping insertion in model container [2025-02-05 17:56:23,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:56:23" (3/3) ... [2025-02-05 17:56:23,913 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c [2025-02-05 17:56:23,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:56:23,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c that has 16 procedures, 292 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-02-05 17:56:24,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:56:24,019 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;@3d9a6e40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:56:24,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:56:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 239 states have (on average 1.5146443514644352) internal successors, (362), 248 states have internal predecessors, (362), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 17:56:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:56:24,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:24,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:56:24,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:24,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1493112753, now seen corresponding path program 1 times [2025-02-05 17:56:24,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:24,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881823587] [2025-02-05 17:56:24,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:24,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:24,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:56:24,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:56:24,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:24,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:24,411 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:56:24,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:24,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881823587] [2025-02-05 17:56:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881823587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:24,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:24,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:56:24,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411722954] [2025-02-05 17:56:24,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:24,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:56:24,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:24,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:56:24,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:56:24,442 INFO L87 Difference]: Start difference. First operand has 293 states, 239 states have (on average 1.5146443514644352) internal successors, (362), 248 states have internal predecessors, (362), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) 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:56:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:24,953 INFO L93 Difference]: Finished difference Result 688 states and 1019 transitions. [2025-02-05 17:56:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:56:24,956 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:56:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:24,971 INFO L225 Difference]: With dead ends: 688 [2025-02-05 17:56:24,971 INFO L226 Difference]: Without dead ends: 402 [2025-02-05 17:56:24,978 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:56:24,979 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 343 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:24,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 965 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-05 17:56:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 395. [2025-02-05 17:56:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 323 states have (on average 1.4458204334365325) internal successors, (467), 330 states have internal predecessors, (467), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2025-02-05 17:56:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 564 transitions. [2025-02-05 17:56:25,044 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 564 transitions. Word has length 65 [2025-02-05 17:56:25,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:25,044 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 564 transitions. [2025-02-05 17:56:25,044 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:56:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2025-02-05 17:56:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:56:25,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:25,046 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:56:25,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:56:25,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:25,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:25,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1493815215, now seen corresponding path program 1 times [2025-02-05 17:56:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:25,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682187017] [2025-02-05 17:56:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:25,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:56:25,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:56:25,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:25,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:25,230 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:56:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:25,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682187017] [2025-02-05 17:56:25,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682187017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:25,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:25,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:25,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544459727] [2025-02-05 17:56:25,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:25,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:25,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:25,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:25,235 INFO L87 Difference]: Start difference. First operand 395 states and 564 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:56:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:26,026 INFO L93 Difference]: Finished difference Result 768 states and 1082 transitions. [2025-02-05 17:56:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:26,027 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:56:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:26,030 INFO L225 Difference]: With dead ends: 768 [2025-02-05 17:56:26,030 INFO L226 Difference]: Without dead ends: 555 [2025-02-05 17:56:26,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:56:26,031 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 574 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:26,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1249 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:56:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-05 17:56:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 509. [2025-02-05 17:56:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 415 states have (on average 1.4313253012048193) internal successors, (594), 424 states have internal predecessors, (594), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2025-02-05 17:56:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 725 transitions. [2025-02-05 17:56:26,076 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 725 transitions. Word has length 65 [2025-02-05 17:56:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:26,076 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 725 transitions. [2025-02-05 17:56:26,077 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:56:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 725 transitions. [2025-02-05 17:56:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:56:26,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:26,081 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:56:26,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:56:26,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1667961488, now seen corresponding path program 1 times [2025-02-05 17:56:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881817822] [2025-02-05 17:56:26,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:26,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:56:26,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:56:26,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:26,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:26,204 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:56:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:26,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881817822] [2025-02-05 17:56:26,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881817822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:26,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:56:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15790161] [2025-02-05 17:56:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:26,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:56:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:26,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:56:26,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:56:26,205 INFO L87 Difference]: Start difference. First operand 509 states and 725 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-05 17:56:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:27,141 INFO L93 Difference]: Finished difference Result 1953 states and 2762 transitions. [2025-02-05 17:56:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:56:27,141 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), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2025-02-05 17:56:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:27,148 INFO L225 Difference]: With dead ends: 1953 [2025-02-05 17:56:27,148 INFO L226 Difference]: Without dead ends: 1614 [2025-02-05 17:56:27,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:56:27,150 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 2014 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:27,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 1456 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:56:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2025-02-05 17:56:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1567. [2025-02-05 17:56:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1268 states have (on average 1.3722397476340693) internal successors, (1740), 1292 states have internal predecessors, (1740), 171 states have call successors, (171), 112 states have call predecessors, (171), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2025-02-05 17:56:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2114 transitions. [2025-02-05 17:56:27,257 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2114 transitions. Word has length 65 [2025-02-05 17:56:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:27,257 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2114 transitions. [2025-02-05 17:56:27,258 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), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-05 17:56:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2114 transitions. [2025-02-05 17:56:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:56:27,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:27,259 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:56:27,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:56:27,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:27,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1309873832, now seen corresponding path program 1 times [2025-02-05 17:56:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:27,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120134864] [2025-02-05 17:56:27,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:27,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:56:27,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:56:27,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:27,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:27,375 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:56:27,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:27,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120134864] [2025-02-05 17:56:27,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120134864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:27,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:27,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196775129] [2025-02-05 17:56:27,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:27,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:27,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:27,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:27,377 INFO L87 Difference]: Start difference. First operand 1567 states and 2114 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:56:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:27,554 INFO L93 Difference]: Finished difference Result 2998 states and 4044 transitions. [2025-02-05 17:56:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:56:27,559 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:56:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:27,570 INFO L225 Difference]: With dead ends: 2998 [2025-02-05 17:56:27,571 INFO L226 Difference]: Without dead ends: 1607 [2025-02-05 17:56:27,573 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:56:27,577 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:27,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2004 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:56:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-02-05 17:56:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2025-02-05 17:56:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1300 states have (on average 1.3584615384615384) internal successors, (1766), 1324 states have internal predecessors, (1766), 171 states have call successors, (171), 112 states have call predecessors, (171), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2025-02-05 17:56:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2148 transitions. [2025-02-05 17:56:27,712 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2148 transitions. Word has length 66 [2025-02-05 17:56:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:27,712 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2148 transitions. [2025-02-05 17:56:27,712 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:56:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2148 transitions. [2025-02-05 17:56:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:56:27,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:27,713 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:56:27,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:56:27,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 322930167, now seen corresponding path program 1 times [2025-02-05 17:56:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164657326] [2025-02-05 17:56:27,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:27,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:56:27,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:56:27,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:27,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:27,832 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:56:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:27,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164657326] [2025-02-05 17:56:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164657326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:27,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:27,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:56:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234251286] [2025-02-05 17:56:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:27,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:56:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:27,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:56:27,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:56:27,834 INFO L87 Difference]: Start difference. First operand 1607 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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:56:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:28,829 INFO L93 Difference]: Finished difference Result 4879 states and 6531 transitions. [2025-02-05 17:56:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:56:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2025-02-05 17:56:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:28,836 INFO L225 Difference]: With dead ends: 4879 [2025-02-05 17:56:28,837 INFO L226 Difference]: Without dead ends: 1811 [2025-02-05 17:56:28,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:56:28,842 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 2030 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2048 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:28,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2048 Valid, 1498 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:56:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-02-05 17:56:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1752. [2025-02-05 17:56:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1382 states have (on average 1.3111432706222865) internal successors, (1812), 1408 states have internal predecessors, (1812), 205 states have call successors, (205), 134 states have call predecessors, (205), 163 states have return successors, (246), 212 states have call predecessors, (246), 201 states have call successors, (246) [2025-02-05 17:56:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2263 transitions. [2025-02-05 17:56:28,955 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2263 transitions. Word has length 66 [2025-02-05 17:56:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:28,959 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2263 transitions. [2025-02-05 17:56:28,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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:56:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2263 transitions. [2025-02-05 17:56:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:28,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:28,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:56:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:56:28,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1769155916, now seen corresponding path program 1 times [2025-02-05 17:56:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059412371] [2025-02-05 17:56:28,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:28,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:28,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:28,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:28,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:29,067 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:56:29,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:29,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059412371] [2025-02-05 17:56:29,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059412371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:29,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:56:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551769542] [2025-02-05 17:56:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:29,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:56:29,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:29,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:56:29,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:56:29,068 INFO L87 Difference]: Start difference. First operand 1752 states and 2263 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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:56:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:29,574 INFO L93 Difference]: Finished difference Result 2076 states and 2747 transitions. [2025-02-05 17:56:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:56:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2025-02-05 17:56:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:29,582 INFO L225 Difference]: With dead ends: 2076 [2025-02-05 17:56:29,583 INFO L226 Difference]: Without dead ends: 1920 [2025-02-05 17:56:29,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:29,585 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 597 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:29,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 873 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-02-05 17:56:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1907. [2025-02-05 17:56:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1518 states have (on average 1.3287220026350461) internal successors, (2017), 1545 states have internal predecessors, (2017), 217 states have call successors, (217), 140 states have call predecessors, (217), 170 states have return successors, (259), 224 states have call predecessors, (259), 213 states have call successors, (259) [2025-02-05 17:56:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2493 transitions. [2025-02-05 17:56:29,666 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2493 transitions. Word has length 80 [2025-02-05 17:56:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:29,666 INFO L471 AbstractCegarLoop]: Abstraction has 1907 states and 2493 transitions. [2025-02-05 17:56:29,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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:56:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2493 transitions. [2025-02-05 17:56:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:29,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:29,669 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] [2025-02-05 17:56:29,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:56:29,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:29,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash -242392526, now seen corresponding path program 1 times [2025-02-05 17:56:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:29,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679401518] [2025-02-05 17:56:29,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:29,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:29,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:29,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:29,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:29,823 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:56:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679401518] [2025-02-05 17:56:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679401518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:29,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:29,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816664394] [2025-02-05 17:56:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:29,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:29,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:29,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:29,825 INFO L87 Difference]: Start difference. First operand 1907 states and 2493 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:30,696 INFO L93 Difference]: Finished difference Result 2409 states and 3244 transitions. [2025-02-05 17:56:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:30,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2025-02-05 17:56:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:30,707 INFO L225 Difference]: With dead ends: 2409 [2025-02-05 17:56:30,707 INFO L226 Difference]: Without dead ends: 2098 [2025-02-05 17:56:30,708 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:56:30,709 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 588 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:30,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1536 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:56:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2025-02-05 17:56:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2053. [2025-02-05 17:56:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1645 states have (on average 1.3398176291793313) internal successors, (2204), 1673 states have internal predecessors, (2204), 229 states have call successors, (229), 146 states have call predecessors, (229), 177 states have return successors, (274), 237 states have call predecessors, (274), 225 states have call successors, (274) [2025-02-05 17:56:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2707 transitions. [2025-02-05 17:56:30,836 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2707 transitions. Word has length 80 [2025-02-05 17:56:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:30,836 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2707 transitions. [2025-02-05 17:56:30,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2707 transitions. [2025-02-05 17:56:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:30,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:30,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:56:30,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:56:30,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:30,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1062001203, now seen corresponding path program 1 times [2025-02-05 17:56:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846787893] [2025-02-05 17:56:30,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:30,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:30,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:30,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:30,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:30,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:56:30,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:30,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846787893] [2025-02-05 17:56:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846787893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:30,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:30,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:30,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888905084] [2025-02-05 17:56:30,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:30,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:30,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:30,928 INFO L87 Difference]: Start difference. First operand 2053 states and 2707 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:31,719 INFO L93 Difference]: Finished difference Result 2863 states and 3917 transitions. [2025-02-05 17:56:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:31,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2025-02-05 17:56:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:31,732 INFO L225 Difference]: With dead ends: 2863 [2025-02-05 17:56:31,732 INFO L226 Difference]: Without dead ends: 2406 [2025-02-05 17:56:31,734 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:56:31,735 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 583 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:31,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1520 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:56:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2025-02-05 17:56:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2358. [2025-02-05 17:56:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1910 states have (on average 1.3596858638743456) internal successors, (2597), 1942 states have internal predecessors, (2597), 253 states have call successors, (253), 158 states have call predecessors, (253), 193 states have return successors, (310), 263 states have call predecessors, (310), 249 states have call successors, (310) [2025-02-05 17:56:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3160 transitions. [2025-02-05 17:56:31,856 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3160 transitions. Word has length 80 [2025-02-05 17:56:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:31,856 INFO L471 AbstractCegarLoop]: Abstraction has 2358 states and 3160 transitions. [2025-02-05 17:56:31,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3160 transitions. [2025-02-05 17:56:31,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:31,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:31,861 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] [2025-02-05 17:56:31,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:56:31,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:31,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1112678894, now seen corresponding path program 1 times [2025-02-05 17:56:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:31,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340822466] [2025-02-05 17:56:31,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:31,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:31,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:31,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:31,949 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:56:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340822466] [2025-02-05 17:56:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340822466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158514156] [2025-02-05 17:56:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:31,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:31,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:31,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:31,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:31,951 INFO L87 Difference]: Start difference. First operand 2358 states and 3160 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:32,531 INFO L93 Difference]: Finished difference Result 3818 states and 5360 transitions. [2025-02-05 17:56:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2025-02-05 17:56:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:32,544 INFO L225 Difference]: With dead ends: 3818 [2025-02-05 17:56:32,544 INFO L226 Difference]: Without dead ends: 3056 [2025-02-05 17:56:32,547 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:56:32,548 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 578 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:32,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1508 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2025-02-05 17:56:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 3001. [2025-02-05 17:56:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 2467 states have (on average 1.389947304418322) internal successors, (3429), 2513 states have internal predecessors, (3429), 301 states have call successors, (301), 182 states have call predecessors, (301), 231 states have return successors, (406), 315 states have call predecessors, (406), 297 states have call successors, (406) [2025-02-05 17:56:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4136 transitions. [2025-02-05 17:56:32,716 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4136 transitions. Word has length 80 [2025-02-05 17:56:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:32,716 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 4136 transitions. [2025-02-05 17:56:32,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4136 transitions. [2025-02-05 17:56:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:32,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:32,722 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] [2025-02-05 17:56:32,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:56:32,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:32,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1321377197, now seen corresponding path program 1 times [2025-02-05 17:56:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805297914] [2025-02-05 17:56:32,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:32,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:32,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:32,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:32,878 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:56:32,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805297914] [2025-02-05 17:56:32,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805297914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:32,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:32,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:32,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164753040] [2025-02-05 17:56:32,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:32,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:32,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:32,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:32,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:32,880 INFO L87 Difference]: Start difference. First operand 3001 states and 4136 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:33,683 INFO L93 Difference]: Finished difference Result 6049 states and 8819 transitions. [2025-02-05 17:56:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:33,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2025-02-05 17:56:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:33,700 INFO L225 Difference]: With dead ends: 6049 [2025-02-05 17:56:33,700 INFO L226 Difference]: Without dead ends: 4644 [2025-02-05 17:56:33,704 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:56:33,704 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 677 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:33,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1483 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:56:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2025-02-05 17:56:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 4344. [2025-02-05 17:56:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4344 states, 3628 states have (on average 1.4280595369349505) internal successors, (5181), 3720 states have internal predecessors, (5181), 389 states have call successors, (389), 230 states have call predecessors, (389), 325 states have return successors, (686), 411 states have call predecessors, (686), 385 states have call successors, (686) [2025-02-05 17:56:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 6256 transitions. [2025-02-05 17:56:33,910 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 6256 transitions. Word has length 80 [2025-02-05 17:56:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:33,910 INFO L471 AbstractCegarLoop]: Abstraction has 4344 states and 6256 transitions. [2025-02-05 17:56:33,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 6256 transitions. [2025-02-05 17:56:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:33,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:33,913 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] [2025-02-05 17:56:33,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:56:33,914 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:33,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1165742578, now seen corresponding path program 1 times [2025-02-05 17:56:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:33,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413888227] [2025-02-05 17:56:33,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:33,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:33,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:33,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:33,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:33,977 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:56:33,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:33,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413888227] [2025-02-05 17:56:33,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413888227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:33,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:33,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83431648] [2025-02-05 17:56:33,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:33,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:33,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:33,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:33,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:33,979 INFO L87 Difference]: Start difference. First operand 4344 states and 6256 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:34,769 INFO L93 Difference]: Finished difference Result 10368 states and 15933 transitions. [2025-02-05 17:56:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:34,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2025-02-05 17:56:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:34,798 INFO L225 Difference]: With dead ends: 10368 [2025-02-05 17:56:34,798 INFO L226 Difference]: Without dead ends: 7620 [2025-02-05 17:56:34,805 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:56:34,806 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 641 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:34,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1467 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:56:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2025-02-05 17:56:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 7019. [2025-02-05 17:56:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7019 states, 5893 states have (on average 1.454776853894451) internal successors, (8573), 6131 states have internal predecessors, (8573), 557 states have call successors, (557), 326 states have call predecessors, (557), 567 states have return successors, (1622), 595 states have call predecessors, (1622), 553 states have call successors, (1622) [2025-02-05 17:56:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7019 states to 7019 states and 10752 transitions. [2025-02-05 17:56:35,254 INFO L78 Accepts]: Start accepts. Automaton has 7019 states and 10752 transitions. Word has length 80 [2025-02-05 17:56:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:35,255 INFO L471 AbstractCegarLoop]: Abstraction has 7019 states and 10752 transitions. [2025-02-05 17:56:35,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7019 states and 10752 transitions. [2025-02-05 17:56:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:35,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:35,260 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] [2025-02-05 17:56:35,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:56:35,261 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:35,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:35,261 INFO L85 PathProgramCache]: Analyzing trace with hash -953741, now seen corresponding path program 1 times [2025-02-05 17:56:35,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:35,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232276230] [2025-02-05 17:56:35,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:35,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:35,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:35,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:35,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:35,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:35,340 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:56:35,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:35,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232276230] [2025-02-05 17:56:35,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232276230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:35,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376846990] [2025-02-05 17:56:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:35,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:35,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:35,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:35,343 INFO L87 Difference]: Start difference. First operand 7019 states and 10752 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:36,290 INFO L93 Difference]: Finished difference Result 18923 states and 31443 transitions. [2025-02-05 17:56:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:36,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2025-02-05 17:56:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:36,348 INFO L225 Difference]: With dead ends: 18923 [2025-02-05 17:56:36,348 INFO L226 Difference]: Without dead ends: 13500 [2025-02-05 17:56:36,366 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:56:36,367 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 607 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:36,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1459 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13500 states. [2025-02-05 17:56:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13500 to 12902. [2025-02-05 17:56:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12902 states, 10810 states have (on average 1.4742830712303423) internal successors, (15937), 11502 states have internal predecessors, (15937), 877 states have call successors, (877), 518 states have call predecessors, (877), 1213 states have return successors, (5014), 947 states have call predecessors, (5014), 873 states have call successors, (5014) [2025-02-05 17:56:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12902 states to 12902 states and 21828 transitions. [2025-02-05 17:56:37,031 INFO L78 Accepts]: Start accepts. Automaton has 12902 states and 21828 transitions. Word has length 80 [2025-02-05 17:56:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 12902 states and 21828 transitions. [2025-02-05 17:56:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 12902 states and 21828 transitions. [2025-02-05 17:56:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:37,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:37,039 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] [2025-02-05 17:56:37,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:56:37,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:37,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash 99958226, now seen corresponding path program 1 times [2025-02-05 17:56:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:37,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018492036] [2025-02-05 17:56:37,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:37,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:37,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:37,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:37,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:37,099 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:56:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018492036] [2025-02-05 17:56:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018492036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:37,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:37,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995069358] [2025-02-05 17:56:37,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:37,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:37,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:37,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:37,101 INFO L87 Difference]: Start difference. First operand 12902 states and 21828 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:38,904 INFO L93 Difference]: Finished difference Result 37226 states and 70673 transitions. [2025-02-05 17:56:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:38,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2025-02-05 17:56:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:39,011 INFO L225 Difference]: With dead ends: 37226 [2025-02-05 17:56:39,011 INFO L226 Difference]: Without dead ends: 25920 [2025-02-05 17:56:39,044 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:56:39,045 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 572 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:39,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1447 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25920 states. [2025-02-05 17:56:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25920 to 25277. [2025-02-05 17:56:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25277 states, 20815 states have (on average 1.468220033629594) internal successors, (30561), 22901 states have internal predecessors, (30561), 1477 states have call successors, (1477), 894 states have call predecessors, (1477), 2983 states have return successors, (17902), 1611 states have call predecessors, (17902), 1473 states have call successors, (17902) [2025-02-05 17:56:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25277 states to 25277 states and 49940 transitions. [2025-02-05 17:56:40,649 INFO L78 Accepts]: Start accepts. Automaton has 25277 states and 49940 transitions. Word has length 80 [2025-02-05 17:56:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:40,649 INFO L471 AbstractCegarLoop]: Abstraction has 25277 states and 49940 transitions. [2025-02-05 17:56:40,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:56:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 25277 states and 49940 transitions. [2025-02-05 17:56:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:56:40,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:40,677 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] [2025-02-05 17:56:40,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:56:40,678 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:40,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash 380308115, now seen corresponding path program 1 times [2025-02-05 17:56:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332649411] [2025-02-05 17:56:40,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:40,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:56:40,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:56:40,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:40,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:40,721 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:56:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332649411] [2025-02-05 17:56:40,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332649411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:40,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:40,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:56:40,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580701780] [2025-02-05 17:56:40,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:40,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:56:40,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:40,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:56:40,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:56:40,723 INFO L87 Difference]: Start difference. First operand 25277 states and 49940 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:56:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:43,256 INFO L93 Difference]: Finished difference Result 61758 states and 123320 transitions. [2025-02-05 17:56:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:56:43,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:56:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:43,400 INFO L225 Difference]: With dead ends: 61758 [2025-02-05 17:56:43,400 INFO L226 Difference]: Without dead ends: 38078 [2025-02-05 17:56:43,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:56:43,455 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 556 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:43,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1083 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:56:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38078 states. [2025-02-05 17:56:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38078 to 35745. [2025-02-05 17:56:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35745 states, 29542 states have (on average 1.4531175952880644) internal successors, (42928), 32359 states have internal predecessors, (42928), 2162 states have call successors, (2162), 1284 states have call predecessors, (2162), 4039 states have return successors, (22620), 2231 states have call predecessors, (22620), 2158 states have call successors, (22620) [2025-02-05 17:56:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35745 states to 35745 states and 67710 transitions. [2025-02-05 17:56:45,728 INFO L78 Accepts]: Start accepts. Automaton has 35745 states and 67710 transitions. Word has length 80 [2025-02-05 17:56:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:45,728 INFO L471 AbstractCegarLoop]: Abstraction has 35745 states and 67710 transitions. [2025-02-05 17:56:45,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:56:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 35745 states and 67710 transitions. [2025-02-05 17:56:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:56:45,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:45,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:56:45,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:56:45,756 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:45,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1637861458, now seen corresponding path program 1 times [2025-02-05 17:56:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92368018] [2025-02-05 17:56:45,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:45,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:56:45,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:56:45,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:45,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 17:56:45,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:45,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92368018] [2025-02-05 17:56:45,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92368018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:45,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:45,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:45,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438458172] [2025-02-05 17:56:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:45,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:45,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:45,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:45,814 INFO L87 Difference]: Start difference. First operand 35745 states and 67710 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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:56:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:47,723 INFO L93 Difference]: Finished difference Result 37381 states and 69821 transitions. [2025-02-05 17:56:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:56:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 108 [2025-02-05 17:56:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:47,852 INFO L225 Difference]: With dead ends: 37381 [2025-02-05 17:56:47,852 INFO L226 Difference]: Without dead ends: 35805 [2025-02-05 17:56:47,874 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:56:47,874 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 0 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1950 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:56:47,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1950 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:56:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35805 states. [2025-02-05 17:56:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35805 to 35805. [2025-02-05 17:56:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35805 states, 29590 states have (on average 1.4521797904697533) internal successors, (42970), 32407 states have internal predecessors, (42970), 2162 states have call successors, (2162), 1284 states have call predecessors, (2162), 4051 states have return successors, (22632), 2243 states have call predecessors, (22632), 2158 states have call successors, (22632) [2025-02-05 17:56:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35805 states to 35805 states and 67764 transitions. [2025-02-05 17:56:50,619 INFO L78 Accepts]: Start accepts. Automaton has 35805 states and 67764 transitions. Word has length 108 [2025-02-05 17:56:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:50,619 INFO L471 AbstractCegarLoop]: Abstraction has 35805 states and 67764 transitions. [2025-02-05 17:56:50,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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:56:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 35805 states and 67764 transitions. [2025-02-05 17:56:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:56:50,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:50,667 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:56:50,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:56:50,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash -683632563, now seen corresponding path program 1 times [2025-02-05 17:56:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955413576] [2025-02-05 17:56:50,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:50,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:56:50,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:56:50,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:50,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 17:56:50,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955413576] [2025-02-05 17:56:50,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955413576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:50,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:50,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704470175] [2025-02-05 17:56:50,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:50,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:50,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:50,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:50,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:50,766 INFO L87 Difference]: Start difference. First operand 35805 states and 67764 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:56:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:52,450 INFO L93 Difference]: Finished difference Result 37190 states and 69504 transitions. [2025-02-05 17:56:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:56:52,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 108 [2025-02-05 17:56:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:52,604 INFO L225 Difference]: With dead ends: 37190 [2025-02-05 17:56:52,604 INFO L226 Difference]: Without dead ends: 35793 [2025-02-05 17:56:52,627 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:56:52,628 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 576 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:52,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 992 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:56:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35793 states. [2025-02-05 17:56:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35793 to 35583. [2025-02-05 17:56:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35583 states, 29421 states have (on average 1.4531117229190034) internal successors, (42752), 32233 states have internal predecessors, (42752), 2134 states have call successors, (2134), 1265 states have call predecessors, (2134), 4026 states have return successors, (22592), 2213 states have call predecessors, (22592), 2130 states have call successors, (22592) [2025-02-05 17:56:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35583 states to 35583 states and 67478 transitions. [2025-02-05 17:56:54,869 INFO L78 Accepts]: Start accepts. Automaton has 35583 states and 67478 transitions. Word has length 108 [2025-02-05 17:56:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:54,869 INFO L471 AbstractCegarLoop]: Abstraction has 35583 states and 67478 transitions. [2025-02-05 17:56:54,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:56:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 35583 states and 67478 transitions. [2025-02-05 17:56:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:56:54,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:54,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:56:54,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:56:54,893 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:54,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 620761166, now seen corresponding path program 1 times [2025-02-05 17:56:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:54,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770695491] [2025-02-05 17:56:54,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:54,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:56:54,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:56:54,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:54,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 17:56:54,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:54,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770695491] [2025-02-05 17:56:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770695491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:54,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:56:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973140450] [2025-02-05 17:56:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:54,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:56:54,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:54,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:56:54,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:56:54,985 INFO L87 Difference]: Start difference. First operand 35583 states and 67478 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 17:56:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:57,057 INFO L93 Difference]: Finished difference Result 38412 states and 71110 transitions. [2025-02-05 17:56:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:56:57,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 108 [2025-02-05 17:56:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:57,194 INFO L225 Difference]: With dead ends: 38412 [2025-02-05 17:56:57,195 INFO L226 Difference]: Without dead ends: 36999 [2025-02-05 17:56:57,215 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:56:57,215 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 499 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:57,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 499 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:56:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36999 states.