./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.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.11.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 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:57:13,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:57:13,379 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:57:13,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:57:13,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:57:13,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:57:13,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:57:13,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:57:13,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:57:13,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:57:13,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:57:13,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:57:13,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:57:13,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:57:13,406 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:57:13,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:57:13,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:57:13,406 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:57:13,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:57:13,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:57:13,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:57:13,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:57:13,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:57:13,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:57:13,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:57:13,408 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 -> 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 [2025-02-05 17:57:13,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:57:13,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:57:13,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:57:13,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:57:13,665 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:57:13,665 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.11.cil-1.c [2025-02-05 17:57:14,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c71b5c8c/f669cfd5d0604e1ea847ad248034d045/FLAG9b3d047ad [2025-02-05 17:57:15,201 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:57:15,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c [2025-02-05 17:57:15,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c71b5c8c/f669cfd5d0604e1ea847ad248034d045/FLAG9b3d047ad [2025-02-05 17:57:15,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c71b5c8c/f669cfd5d0604e1ea847ad248034d045 [2025-02-05 17:57:15,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:57:15,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:57:15,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:57:15,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:57:15,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:57:15,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c7e7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15, skipping insertion in model container [2025-02-05 17:57:15,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:57:15,644 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.11.cil-1.c[911,924] [2025-02-05 17:57:15,704 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.11.cil-1.c[8416,8429] [2025-02-05 17:57:15,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:57:15,802 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:57:15,811 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.11.cil-1.c[911,924] [2025-02-05 17:57:15,827 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.11.cil-1.c[8416,8429] [2025-02-05 17:57:15,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:57:15,903 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:57:15,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15 WrapperNode [2025-02-05 17:57:15,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:57:15,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:57:15,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:57:15,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:57:15,909 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:57:15" (1/1) ... [2025-02-05 17:57:15,919 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:57:15" (1/1) ... [2025-02-05 17:57:15,944 INFO L138 Inliner]: procedures = 77, calls = 95, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 998 [2025-02-05 17:57:15,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:57:15,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:57:15,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:57:15,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:57:15,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,968 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:57:15,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:57:15,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:57:15,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:57:15,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:57:15,985 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:57:15,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:57:16,012 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:57:16,018 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:57:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:57:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:57:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:57:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:57:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:57:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:57:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:57:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:57:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:57:16,145 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:57:16,147 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:57:16,720 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-02-05 17:57:16,720 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:57:16,720 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-02-05 17:57:16,880 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-02-05 17:57:16,880 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:57:16,900 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:57:16,900 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:57:16,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:57:16 BoogieIcfgContainer [2025-02-05 17:57:16,900 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:57:16,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:57:16,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:57:16,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:57:16,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:57:15" (1/3) ... [2025-02-05 17:57:16,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bacce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:57:16, skipping insertion in model container [2025-02-05 17:57:16,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (2/3) ... [2025-02-05 17:57:16,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bacce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:57:16, skipping insertion in model container [2025-02-05 17:57:16,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:57:16" (3/3) ... [2025-02-05 17:57:16,907 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-1.c [2025-02-05 17:57:16,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:57:16,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.11.cil-1.c that has 16 procedures, 508 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-02-05 17:57:16,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:57:16,999 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;@517d4f3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:57:17,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:57:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 509 states, 447 states have (on average 1.5615212527964206) internal successors, (698), 456 states have internal predecessors, (698), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-05 17:57:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:17,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:17,014 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:57:17,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:17,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1200078175, now seen corresponding path program 1 times [2025-02-05 17:57:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420892722] [2025-02-05 17:57:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:17,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:17,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:17,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:17,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:17,403 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:57:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420892722] [2025-02-05 17:57:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420892722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:17,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445523131] [2025-02-05 17:57:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:17,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:17,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:17,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:17,440 INFO L87 Difference]: Start difference. First operand has 509 states, 447 states have (on average 1.5615212527964206) internal successors, (698), 456 states have internal predecessors, (698), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) 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:57:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:18,227 INFO L93 Difference]: Finished difference Result 1112 states and 1707 transitions. [2025-02-05 17:57:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:18,229 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:57:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:18,237 INFO L225 Difference]: With dead ends: 1112 [2025-02-05 17:57:18,237 INFO L226 Difference]: Without dead ends: 618 [2025-02-05 17:57:18,241 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:57:18,242 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 503 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:18,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1661 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:57:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-02-05 17:57:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 611. [2025-02-05 17:57:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 531 states have (on average 1.497175141242938) internal successors, (795), 538 states have internal predecessors, (795), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2025-02-05 17:57:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 908 transitions. [2025-02-05 17:57:18,293 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 908 transitions. Word has length 65 [2025-02-05 17:57:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:18,293 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 908 transitions. [2025-02-05 17:57:18,293 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:57:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 908 transitions. [2025-02-05 17:57:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:18,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:18,296 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:57:18,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:57:18,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:18,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -107961153, now seen corresponding path program 1 times [2025-02-05 17:57:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303757567] [2025-02-05 17:57:18,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:18,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:18,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:18,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:18,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:18,534 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:57:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303757567] [2025-02-05 17:57:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303757567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:18,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112896754] [2025-02-05 17:57:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:18,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:18,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:18,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:18,536 INFO L87 Difference]: Start difference. First operand 611 states and 908 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:57:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:19,485 INFO L93 Difference]: Finished difference Result 984 states and 1426 transitions. [2025-02-05 17:57:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:19,485 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:57:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:19,493 INFO L225 Difference]: With dead ends: 984 [2025-02-05 17:57:19,493 INFO L226 Difference]: Without dead ends: 771 [2025-02-05 17:57:19,494 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:57:19,494 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1070 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:19,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1929 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:57:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-02-05 17:57:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 725. [2025-02-05 17:57:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 623 states have (on average 1.4799357945425362) internal successors, (922), 632 states have internal predecessors, (922), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2025-02-05 17:57:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1069 transitions. [2025-02-05 17:57:19,560 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1069 transitions. Word has length 65 [2025-02-05 17:57:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:19,560 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1069 transitions. [2025-02-05 17:57:19,560 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:57:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1069 transitions. [2025-02-05 17:57:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:19,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:19,563 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:57:19,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:57:19,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1025229440, now seen corresponding path program 1 times [2025-02-05 17:57:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860844879] [2025-02-05 17:57:19,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:19,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:19,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:19,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:19,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:19,707 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:57:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:19,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860844879] [2025-02-05 17:57:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860844879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:19,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:57:19,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078383782] [2025-02-05 17:57:19,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:19,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:57:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:19,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:57:19,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:19,710 INFO L87 Difference]: Start difference. First operand 725 states and 1069 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:57:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:20,939 INFO L93 Difference]: Finished difference Result 2169 states and 3106 transitions. [2025-02-05 17:57:20,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:57:20,939 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:57:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:20,946 INFO L225 Difference]: With dead ends: 2169 [2025-02-05 17:57:20,946 INFO L226 Difference]: Without dead ends: 1830 [2025-02-05 17:57:20,947 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:57:20,948 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 3318 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:20,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 2136 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:57:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2025-02-05 17:57:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1783. [2025-02-05 17:57:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1476 states have (on average 1.4010840108401084) internal successors, (2068), 1500 states have internal predecessors, (2068), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2025-02-05 17:57:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2458 transitions. [2025-02-05 17:57:21,037 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2458 transitions. Word has length 65 [2025-02-05 17:57:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:21,038 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2458 transitions. [2025-02-05 17:57:21,038 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:57:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2458 transitions. [2025-02-05 17:57:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:57:21,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:21,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] [2025-02-05 17:57:21,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:57:21,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:21,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1400161712, now seen corresponding path program 1 times [2025-02-05 17:57:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562902998] [2025-02-05 17:57:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:21,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:57:21,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:57:21,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:21,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:21,106 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:57:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562902998] [2025-02-05 17:57:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562902998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513111164] [2025-02-05 17:57:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:21,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:21,107 INFO L87 Difference]: Start difference. First operand 1783 states and 2458 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:57:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:21,202 INFO L93 Difference]: Finished difference Result 3214 states and 4388 transitions. [2025-02-05 17:57:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:21,202 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:57:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:21,215 INFO L225 Difference]: With dead ends: 3214 [2025-02-05 17:57:21,215 INFO L226 Difference]: Without dead ends: 1823 [2025-02-05 17:57:21,219 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:57:21,219 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 0 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3724 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:57:21,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3724 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2025-02-05 17:57:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1823. [2025-02-05 17:57:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1508 states have (on average 1.3885941644562334) internal successors, (2094), 1532 states have internal predecessors, (2094), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2025-02-05 17:57:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2492 transitions. [2025-02-05 17:57:21,303 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2492 transitions. Word has length 66 [2025-02-05 17:57:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:21,303 INFO L471 AbstractCegarLoop]: Abstraction has 1823 states and 2492 transitions. [2025-02-05 17:57:21,303 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:57:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2492 transitions. [2025-02-05 17:57:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:57:21,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:21,305 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:57:21,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:57:21,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:21,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash 232642287, now seen corresponding path program 1 times [2025-02-05 17:57:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:21,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765891327] [2025-02-05 17:57:21,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:57:21,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:57:21,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:21,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:21,410 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:57:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765891327] [2025-02-05 17:57:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765891327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:21,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:21,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:57:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112211620] [2025-02-05 17:57:21,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:21,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:57:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:21,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:57:21,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:21,414 INFO L87 Difference]: Start difference. First operand 1823 states and 2492 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:57:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:22,730 INFO L93 Difference]: Finished difference Result 5095 states and 6875 transitions. [2025-02-05 17:57:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:57:22,731 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:57:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:22,740 INFO L225 Difference]: With dead ends: 5095 [2025-02-05 17:57:22,740 INFO L226 Difference]: Without dead ends: 2027 [2025-02-05 17:57:22,746 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:57:22,747 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 3334 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3352 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:22,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3352 Valid, 2178 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:57:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2025-02-05 17:57:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1968. [2025-02-05 17:57:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1590 states have (on average 1.3459119496855345) internal successors, (2140), 1616 states have internal predecessors, (2140), 213 states have call successors, (213), 134 states have call predecessors, (213), 163 states have return successors, (254), 220 states have call predecessors, (254), 209 states have call successors, (254) [2025-02-05 17:57:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2607 transitions. [2025-02-05 17:57:22,819 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2607 transitions. Word has length 66 [2025-02-05 17:57:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:22,819 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2607 transitions. [2025-02-05 17:57:22,819 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:57:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2607 transitions. [2025-02-05 17:57:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:22,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:22,821 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:57:22,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:57:22,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1484272506, now seen corresponding path program 1 times [2025-02-05 17:57:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626269012] [2025-02-05 17:57:22,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:22,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:22,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:22,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:22,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:22,894 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:57:22,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626269012] [2025-02-05 17:57:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626269012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370331133] [2025-02-05 17:57:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:22,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:22,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:22,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:22,896 INFO L87 Difference]: Start difference. First operand 1968 states and 2607 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:57:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:22,989 INFO L93 Difference]: Finished difference Result 3604 states and 4718 transitions. [2025-02-05 17:57:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:22,989 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:57:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:22,998 INFO L225 Difference]: With dead ends: 3604 [2025-02-05 17:57:22,998 INFO L226 Difference]: Without dead ends: 2028 [2025-02-05 17:57:23,002 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:57:23,002 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 0 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3675 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:57:23,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3675 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2025-02-05 17:57:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 2028. [2025-02-05 17:57:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1638 states have (on average 1.332112332112332) internal successors, (2182), 1664 states have internal predecessors, (2182), 213 states have call successors, (213), 134 states have call predecessors, (213), 175 states have return successors, (266), 232 states have call predecessors, (266), 209 states have call successors, (266) [2025-02-05 17:57:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2661 transitions. [2025-02-05 17:57:23,077 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2661 transitions. Word has length 108 [2025-02-05 17:57:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:23,077 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 2661 transitions. [2025-02-05 17:57:23,077 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:57:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2661 transitions. [2025-02-05 17:57:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:23,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:23,079 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:57:23,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:57:23,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:23,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash -530043611, now seen corresponding path program 1 times [2025-02-05 17:57:23,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:23,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670896113] [2025-02-05 17:57:23,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:23,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:23,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:23,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:23,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:23,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:23,212 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:57:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670896113] [2025-02-05 17:57:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670896113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:23,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:23,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308062814] [2025-02-05 17:57:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:23,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:23,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:23,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:23,214 INFO L87 Difference]: Start difference. First operand 2028 states and 2661 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:57:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:23,949 INFO L93 Difference]: Finished difference Result 3413 states and 4401 transitions. [2025-02-05 17:57:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:57:23,949 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:57:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:23,958 INFO L225 Difference]: With dead ends: 3413 [2025-02-05 17:57:23,958 INFO L226 Difference]: Without dead ends: 2016 [2025-02-05 17:57:23,961 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:57:23,961 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 1073 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:23,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 1676 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2025-02-05 17:57:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1806. [2025-02-05 17:57:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1469 states have (on average 1.3369639210347175) internal successors, (1964), 1490 states have internal predecessors, (1964), 185 states have call successors, (185), 115 states have call predecessors, (185), 150 states have return successors, (226), 202 states have call predecessors, (226), 181 states have call successors, (226) [2025-02-05 17:57:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2375 transitions. [2025-02-05 17:57:24,081 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2375 transitions. Word has length 108 [2025-02-05 17:57:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:24,082 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2375 transitions. [2025-02-05 17:57:24,082 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:57:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2375 transitions. [2025-02-05 17:57:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:24,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:24,083 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:57:24,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:57:24,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:24,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash 774350118, now seen corresponding path program 1 times [2025-02-05 17:57:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706185934] [2025-02-05 17:57:24,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:24,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:24,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:24,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:24,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:24,145 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:57:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706185934] [2025-02-05 17:57:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706185934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:57:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467329165] [2025-02-05 17:57:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:57:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:24,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:57:24,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:57:24,148 INFO L87 Difference]: Start difference. First operand 1806 states and 2375 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:57:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:24,640 INFO L93 Difference]: Finished difference Result 4635 states and 6007 transitions. [2025-02-05 17:57:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:57:24,640 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:57:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:24,653 INFO L225 Difference]: With dead ends: 4635 [2025-02-05 17:57:24,653 INFO L226 Difference]: Without dead ends: 3222 [2025-02-05 17:57:24,655 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:57:24,656 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 996 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:24,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 845 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:57:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2025-02-05 17:57:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 3222. [2025-02-05 17:57:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3222 states, 2574 states have (on average 1.2933177933177933) internal successors, (3329), 2624 states have internal predecessors, (3329), 340 states have call successors, (340), 222 states have call predecessors, (340), 306 states have return successors, (495), 378 states have call predecessors, (495), 336 states have call successors, (495) [2025-02-05 17:57:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 4164 transitions. [2025-02-05 17:57:24,776 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 4164 transitions. Word has length 108 [2025-02-05 17:57:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:24,776 INFO L471 AbstractCegarLoop]: Abstraction has 3222 states and 4164 transitions. [2025-02-05 17:57:24,776 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2025-02-05 17:57:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 4164 transitions. [2025-02-05 17:57:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:24,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:24,779 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:57:24,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:57:24,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:24,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash -178851515, now seen corresponding path program 1 times [2025-02-05 17:57:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904145505] [2025-02-05 17:57:24,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:24,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:24,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:24,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:24,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:24,835 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:57:24,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904145505] [2025-02-05 17:57:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904145505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:24,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:24,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:57:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30620871] [2025-02-05 17:57:24,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:24,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:57:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:24,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:57:24,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:24,836 INFO L87 Difference]: Start difference. First operand 3222 states and 4164 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:24,902 INFO L93 Difference]: Finished difference Result 4635 states and 5902 transitions. [2025-02-05 17:57:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:57:24,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 108 [2025-02-05 17:57:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:24,911 INFO L225 Difference]: With dead ends: 4635 [2025-02-05 17:57:24,911 INFO L226 Difference]: Without dead ends: 1806 [2025-02-05 17:57:24,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:24,917 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 140 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:24,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1325 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2025-02-05 17:57:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2025-02-05 17:57:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1469 states have (on average 1.3158611300204222) internal successors, (1933), 1490 states have internal predecessors, (1933), 185 states have call successors, (185), 115 states have call predecessors, (185), 150 states have return successors, (226), 202 states have call predecessors, (226), 181 states have call successors, (226) [2025-02-05 17:57:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2344 transitions. [2025-02-05 17:57:24,990 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2344 transitions. Word has length 108 [2025-02-05 17:57:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2344 transitions. [2025-02-05 17:57:24,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2344 transitions. [2025-02-05 17:57:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 17:57:24,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:24,993 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-05 17:57:24,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:57:24,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash 684943782, now seen corresponding path program 1 times [2025-02-05 17:57:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415519499] [2025-02-05 17:57:24,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:25,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 17:57:25,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 17:57:25,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:57:25,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415519499] [2025-02-05 17:57:25,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415519499] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:57:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071016722] [2025-02-05 17:57:25,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:25,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:57:25,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:57:25,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:57:25,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:57:25,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 17:57:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 17:57:25,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:57:25,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:57:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:57:25,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:57:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071016722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:25,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:57:25,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-05 17:57:25,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259894781] [2025-02-05 17:57:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:25,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:57:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:25,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:57:25,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:25,348 INFO L87 Difference]: Start difference. First operand 1806 states and 2344 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:57:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:25,372 INFO L93 Difference]: Finished difference Result 1892 states and 2444 transitions. [2025-02-05 17:57:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:57:25,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2025-02-05 17:57:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:25,376 INFO L225 Difference]: With dead ends: 1892 [2025-02-05 17:57:25,376 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 17:57:25,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:25,380 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 45 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:25,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1292 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 17:57:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-02-05 17:57:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 350 states have (on average 1.54) internal successors, (539), 352 states have internal predecessors, (539), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:57:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 591 transitions. [2025-02-05 17:57:25,394 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 591 transitions. Word has length 110 [2025-02-05 17:57:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:25,395 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 591 transitions. [2025-02-05 17:57:25,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:57:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 591 transitions. [2025-02-05 17:57:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:25,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:25,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:25,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:57:25,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 17:57:25,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:25,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1229616524, now seen corresponding path program 1 times [2025-02-05 17:57:25,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:25,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034252273] [2025-02-05 17:57:25,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:25,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:25,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:25,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,717 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:57:25,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034252273] [2025-02-05 17:57:25,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034252273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:25,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:25,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072793472] [2025-02-05 17:57:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:25,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:25,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:25,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:25,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:25,719 INFO L87 Difference]: Start difference. First operand 384 states and 591 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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:57:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:26,186 INFO L93 Difference]: Finished difference Result 1156 states and 1795 transitions. [2025-02-05 17:57:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:26,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:26,191 INFO L225 Difference]: With dead ends: 1156 [2025-02-05 17:57:26,191 INFO L226 Difference]: Without dead ends: 792 [2025-02-05 17:57:26,192 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:57:26,193 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1105 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:26,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 1665 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:57:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-02-05 17:57:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 763. [2025-02-05 17:57:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 702 states have (on average 1.5498575498575498) internal successors, (1088), 705 states have internal predecessors, (1088), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:57:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1181 transitions. [2025-02-05 17:57:26,214 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1181 transitions. Word has length 168 [2025-02-05 17:57:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:26,214 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1181 transitions. [2025-02-05 17:57:26,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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:57:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1181 transitions. [2025-02-05 17:57:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:26,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:26,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:26,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:57:26,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:26,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1379067378, now seen corresponding path program 1 times [2025-02-05 17:57:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:26,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161455412] [2025-02-05 17:57:26,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:26,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:26,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:26,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:26,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:26,366 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:57:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:26,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161455412] [2025-02-05 17:57:26,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161455412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:26,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:26,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892527875] [2025-02-05 17:57:26,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:26,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:26,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:26,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:26,368 INFO L87 Difference]: Start difference. First operand 763 states and 1181 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:27,079 INFO L93 Difference]: Finished difference Result 1985 states and 3108 transitions. [2025-02-05 17:57:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:27,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:27,085 INFO L225 Difference]: With dead ends: 1985 [2025-02-05 17:57:27,086 INFO L226 Difference]: Without dead ends: 1242 [2025-02-05 17:57:27,088 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:57:27,088 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1112 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 3250 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:27,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 3250 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:27,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-02-05 17:57:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1117. [2025-02-05 17:57:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1029 states have (on average 1.5422740524781342) internal successors, (1587), 1033 states have internal predecessors, (1587), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-05 17:57:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1723 transitions. [2025-02-05 17:57:27,130 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1723 transitions. Word has length 168 [2025-02-05 17:57:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:27,130 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1723 transitions. [2025-02-05 17:57:27,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1723 transitions. [2025-02-05 17:57:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:27,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:27,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:27,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:57:27,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:27,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1967410189, now seen corresponding path program 1 times [2025-02-05 17:57:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933736023] [2025-02-05 17:57:27,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:27,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:27,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:27,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:27,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:27,262 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:57:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933736023] [2025-02-05 17:57:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933736023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:27,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:27,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22172711] [2025-02-05 17:57:27,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:27,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:27,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:27,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:27,263 INFO L87 Difference]: Start difference. First operand 1117 states and 1723 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:27,917 INFO L93 Difference]: Finished difference Result 3111 states and 4861 transitions. [2025-02-05 17:57:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:27,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:27,926 INFO L225 Difference]: With dead ends: 3111 [2025-02-05 17:57:27,926 INFO L226 Difference]: Without dead ends: 2014 [2025-02-05 17:57:27,950 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:57:27,951 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 1107 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 3234 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:27,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 3234 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-02-05 17:57:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1870. [2025-02-05 17:57:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1726 states have (on average 1.5457705677867903) internal successors, (2668), 1734 states have internal predecessors, (2668), 107 states have call successors, (107), 31 states have call predecessors, (107), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-02-05 17:57:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2896 transitions. [2025-02-05 17:57:27,997 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2896 transitions. Word has length 168 [2025-02-05 17:57:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:27,998 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2896 transitions. [2025-02-05 17:57:27,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2896 transitions. [2025-02-05 17:57:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:28,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:28,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:28,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:57:28,000 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:28,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1798266414, now seen corresponding path program 1 times [2025-02-05 17:57:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942993332] [2025-02-05 17:57:28,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:28,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:28,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:28,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:28,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:28,113 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:57:28,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:28,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942993332] [2025-02-05 17:57:28,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942993332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:28,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:28,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677052412] [2025-02-05 17:57:28,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:28,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:28,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:28,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:28,115 INFO L87 Difference]: Start difference. First operand 1870 states and 2896 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:28,787 INFO L93 Difference]: Finished difference Result 5538 states and 8720 transitions. [2025-02-05 17:57:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:28,802 INFO L225 Difference]: With dead ends: 5538 [2025-02-05 17:57:28,803 INFO L226 Difference]: Without dead ends: 3688 [2025-02-05 17:57:28,807 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:57:28,808 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 1102 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3222 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:28,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3222 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2025-02-05 17:57:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3505. [2025-02-05 17:57:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 3243 states have (on average 1.562750539623805) internal successors, (5068), 3265 states have internal predecessors, (5068), 187 states have call successors, (187), 55 states have call predecessors, (187), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-02-05 17:57:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 5504 transitions. [2025-02-05 17:57:28,936 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 5504 transitions. Word has length 168 [2025-02-05 17:57:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:28,936 INFO L471 AbstractCegarLoop]: Abstraction has 3505 states and 5504 transitions. [2025-02-05 17:57:28,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 5504 transitions. [2025-02-05 17:57:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:28,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:28,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:28,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:57:28,939 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:28,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash 562494483, now seen corresponding path program 1 times [2025-02-05 17:57:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:28,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656291860] [2025-02-05 17:57:28,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:28,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:28,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:28,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:28,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:28,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:29,050 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:57:29,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656291860] [2025-02-05 17:57:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656291860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:29,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:29,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103033584] [2025-02-05 17:57:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:29,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:29,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:29,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:29,054 INFO L87 Difference]: Start difference. First operand 3505 states and 5504 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:29,816 INFO L93 Difference]: Finished difference Result 10889 states and 17474 transitions. [2025-02-05 17:57:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:29,851 INFO L225 Difference]: With dead ends: 10889 [2025-02-05 17:57:29,852 INFO L226 Difference]: Without dead ends: 7404 [2025-02-05 17:57:29,860 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:57:29,860 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1097 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:29,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 3210 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7404 states. [2025-02-05 17:57:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7404 to 7144. [2025-02-05 17:57:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.5914302957151478) internal successors, (10548), 6696 states have internal predecessors, (10548), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:57:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11496 transitions. [2025-02-05 17:57:30,049 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11496 transitions. Word has length 168 [2025-02-05 17:57:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:30,050 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11496 transitions. [2025-02-05 17:57:30,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11496 transitions. [2025-02-05 17:57:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:30,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:30,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:30,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:57:30,054 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:30,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1855203918, now seen corresponding path program 1 times [2025-02-05 17:57:30,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:30,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146919687] [2025-02-05 17:57:30,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:30,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:30,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:30,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:30,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:30,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:30,168 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:57:30,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146919687] [2025-02-05 17:57:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146919687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:30,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039881671] [2025-02-05 17:57:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:30,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:30,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:30,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:30,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:30,174 INFO L87 Difference]: Start difference. First operand 7144 states and 11496 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:30,702 INFO L93 Difference]: Finished difference Result 15928 states and 26321 transitions. [2025-02-05 17:57:30,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:30,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:30,727 INFO L225 Difference]: With dead ends: 15928 [2025-02-05 17:57:30,727 INFO L226 Difference]: Without dead ends: 8804 [2025-02-05 17:57:30,742 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:57:30,743 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 788 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:30,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1192 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8804 states. [2025-02-05 17:57:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8804 to 7144. [2025-02-05 17:57:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.5888654194327096) internal successors, (10531), 6696 states have internal predecessors, (10531), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:57:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11479 transitions. [2025-02-05 17:57:30,982 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11479 transitions. Word has length 168 [2025-02-05 17:57:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:30,983 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11479 transitions. [2025-02-05 17:57:30,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11479 transitions. [2025-02-05 17:57:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:30,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:30,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:30,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:57:30,987 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:30,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:30,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1933194189, now seen corresponding path program 1 times [2025-02-05 17:57:30,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:30,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413405291] [2025-02-05 17:57:30,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:30,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:31,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:31,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:31,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:31,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:31,079 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:57:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413405291] [2025-02-05 17:57:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413405291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:31,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:31,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698611739] [2025-02-05 17:57:31,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:31,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:31,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:31,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:31,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:31,080 INFO L87 Difference]: Start difference. First operand 7144 states and 11479 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:31,493 INFO L93 Difference]: Finished difference Result 15845 states and 26121 transitions. [2025-02-05 17:57:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:31,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:31,550 INFO L225 Difference]: With dead ends: 15845 [2025-02-05 17:57:31,550 INFO L226 Difference]: Without dead ends: 8721 [2025-02-05 17:57:31,561 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:57:31,561 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 785 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:31,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1184 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2025-02-05 17:57:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 7144. [2025-02-05 17:57:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.5863005431502715) internal successors, (10514), 6696 states have internal predecessors, (10514), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:57:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11462 transitions. [2025-02-05 17:57:31,742 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11462 transitions. Word has length 168 [2025-02-05 17:57:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:31,743 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11462 transitions. [2025-02-05 17:57:31,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11462 transitions. [2025-02-05 17:57:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:31,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:31,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:31,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:57:31,748 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:31,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash 419594642, now seen corresponding path program 1 times [2025-02-05 17:57:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:31,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644180297] [2025-02-05 17:57:31,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:31,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:31,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:31,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:31,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:31,843 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:57:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644180297] [2025-02-05 17:57:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644180297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:31,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:31,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:31,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197204508] [2025-02-05 17:57:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:31,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:31,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:31,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:31,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:31,847 INFO L87 Difference]: Start difference. First operand 7144 states and 11462 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:32,281 INFO L93 Difference]: Finished difference Result 15762 states and 25921 transitions. [2025-02-05 17:57:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:32,305 INFO L225 Difference]: With dead ends: 15762 [2025-02-05 17:57:32,305 INFO L226 Difference]: Without dead ends: 8638 [2025-02-05 17:57:32,318 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:57:32,318 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 782 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:32,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1176 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8638 states. [2025-02-05 17:57:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8638 to 7144. [2025-02-05 17:57:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.5837356668678335) internal successors, (10497), 6696 states have internal predecessors, (10497), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:57:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11445 transitions. [2025-02-05 17:57:32,605 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11445 transitions. Word has length 168 [2025-02-05 17:57:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:32,606 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11445 transitions. [2025-02-05 17:57:32,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11445 transitions. [2025-02-05 17:57:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:32,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:32,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:32,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:57:32,611 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:32,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -474340269, now seen corresponding path program 1 times [2025-02-05 17:57:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021932245] [2025-02-05 17:57:32,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:32,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:32,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:32,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:32,746 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:57:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021932245] [2025-02-05 17:57:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021932245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436114769] [2025-02-05 17:57:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:32,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:32,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:32,748 INFO L87 Difference]: Start difference. First operand 7144 states and 11445 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:33,825 INFO L93 Difference]: Finished difference Result 22708 states and 37315 transitions. [2025-02-05 17:57:33,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:33,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:33,868 INFO L225 Difference]: With dead ends: 22708 [2025-02-05 17:57:33,868 INFO L226 Difference]: Without dead ends: 15584 [2025-02-05 17:57:33,880 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:57:33,881 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1068 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:33,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 3141 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15584 states. [2025-02-05 17:57:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15584 to 15232. [2025-02-05 17:57:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 14154 states have (on average 1.6150204889077293) internal successors, (22859), 14368 states have internal predecessors, (22859), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:57:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 25215 transitions. [2025-02-05 17:57:34,375 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 25215 transitions. Word has length 168 [2025-02-05 17:57:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:34,376 INFO L471 AbstractCegarLoop]: Abstraction has 15232 states and 25215 transitions. [2025-02-05 17:57:34,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 25215 transitions. [2025-02-05 17:57:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:34,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:34,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:34,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:57:34,383 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:34,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:34,384 INFO L85 PathProgramCache]: Analyzing trace with hash 605201778, now seen corresponding path program 1 times [2025-02-05 17:57:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:34,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273124669] [2025-02-05 17:57:34,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:34,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:34,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:34,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:34,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:34,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273124669] [2025-02-05 17:57:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273124669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:34,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:34,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584724106] [2025-02-05 17:57:34,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:34,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:34,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:34,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:34,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:34,472 INFO L87 Difference]: Start difference. First operand 15232 states and 25215 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:35,152 INFO L93 Difference]: Finished difference Result 34364 states and 58593 transitions. [2025-02-05 17:57:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:35,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:35,201 INFO L225 Difference]: With dead ends: 34364 [2025-02-05 17:57:35,202 INFO L226 Difference]: Without dead ends: 19152 [2025-02-05 17:57:35,223 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:57:35,224 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 778 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:35,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1162 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19152 states. [2025-02-05 17:57:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19152 to 15232. [2025-02-05 17:57:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 14154 states have (on average 1.6126889925109509) internal successors, (22826), 14368 states have internal predecessors, (22826), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:57:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 25182 transitions. [2025-02-05 17:57:35,947 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 25182 transitions. Word has length 168 [2025-02-05 17:57:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:35,948 INFO L471 AbstractCegarLoop]: Abstraction has 15232 states and 25182 transitions. [2025-02-05 17:57:35,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:57:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 25182 transitions. [2025-02-05 17:57:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:35,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:35,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:35,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:57:35,955 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:35,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash 640025715, now seen corresponding path program 1 times [2025-02-05 17:57:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:35,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11541931] [2025-02-05 17:57:35,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:35,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:35,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:36,082 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:57:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11541931] [2025-02-05 17:57:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11541931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299823228] [2025-02-05 17:57:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:36,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:36,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:36,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:36,085 INFO L87 Difference]: Start difference. First operand 15232 states and 25182 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:37,830 INFO L93 Difference]: Finished difference Result 49442 states and 84500 transitions. [2025-02-05 17:57:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:37,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:37,950 INFO L225 Difference]: With dead ends: 49442 [2025-02-05 17:57:37,950 INFO L226 Difference]: Without dead ends: 34230 [2025-02-05 17:57:37,984 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:57:37,985 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1055 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 3110 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:37,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 3110 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34230 states. [2025-02-05 17:57:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34230 to 33676. [2025-02-05 17:57:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33676 states, 31312 states have (on average 1.6463975472662238) internal successors, (51552), 31980 states have internal predecessors, (51552), 1307 states have call successors, (1307), 391 states have call predecessors, (1307), 1056 states have return successors, (5401), 1368 states have call predecessors, (5401), 1305 states have call successors, (5401) [2025-02-05 17:57:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33676 states to 33676 states and 58260 transitions. [2025-02-05 17:57:39,069 INFO L78 Accepts]: Start accepts. Automaton has 33676 states and 58260 transitions. Word has length 168 [2025-02-05 17:57:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:39,069 INFO L471 AbstractCegarLoop]: Abstraction has 33676 states and 58260 transitions. [2025-02-05 17:57:39,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 33676 states and 58260 transitions. [2025-02-05 17:57:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:39,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:39,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:39,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:57:39,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:39,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1298513582, now seen corresponding path program 1 times [2025-02-05 17:57:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:39,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901780484] [2025-02-05 17:57:39,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:39,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:39,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:39,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:39,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:39,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:39,163 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:57:39,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:39,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901780484] [2025-02-05 17:57:39,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901780484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:39,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443830650] [2025-02-05 17:57:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:39,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:39,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:39,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:39,165 INFO L87 Difference]: Start difference. First operand 33676 states and 58260 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:42,103 INFO L93 Difference]: Finished difference Result 111748 states and 202336 transitions. [2025-02-05 17:57:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:42,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:42,400 INFO L225 Difference]: With dead ends: 111748 [2025-02-05 17:57:42,400 INFO L226 Difference]: Without dead ends: 78092 [2025-02-05 17:57:42,497 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:57:42,498 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1050 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 3098 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:42,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 3098 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:57:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78092 states. [2025-02-05 17:57:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78092 to 77125. [2025-02-05 17:57:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77125 states, 71703 states have (on average 1.6824400652692355) internal successors, (120636), 73765 states have internal predecessors, (120636), 2587 states have call successors, (2587), 775 states have call predecessors, (2587), 2834 states have return successors, (18969), 2712 states have call predecessors, (18969), 2585 states have call successors, (18969) [2025-02-05 17:57:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77125 states to 77125 states and 142192 transitions. [2025-02-05 17:57:45,771 INFO L78 Accepts]: Start accepts. Automaton has 77125 states and 142192 transitions. Word has length 168 [2025-02-05 17:57:45,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:45,771 INFO L471 AbstractCegarLoop]: Abstraction has 77125 states and 142192 transitions. [2025-02-05 17:57:45,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 77125 states and 142192 transitions. [2025-02-05 17:57:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:57:45,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:45,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:45,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:57:45,788 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1548446867, now seen corresponding path program 1 times [2025-02-05 17:57:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61483154] [2025-02-05 17:57:45,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:45,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:57:45,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:57:45,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:45,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:45,867 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:57:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:45,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61483154] [2025-02-05 17:57:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61483154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:45,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:45,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100432908] [2025-02-05 17:57:45,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:45,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:45,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:45,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:45,868 INFO L87 Difference]: Start difference. First operand 77125 states and 142192 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:52,721 INFO L93 Difference]: Finished difference Result 271581 states and 528379 transitions. [2025-02-05 17:57:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:57:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:53,542 INFO L225 Difference]: With dead ends: 271581 [2025-02-05 17:57:53,542 INFO L226 Difference]: Without dead ends: 194476 [2025-02-05 17:57:53,801 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:57:53,802 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1389 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:53,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 3073 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:57:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194476 states.