./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fa3500dbb7b48d33bda6025d194df10b5d868e3a16ab8452fef68790ebc5c6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:07:19,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:07:19,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:07:19,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:07:19,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:07:19,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:07:19,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:07:19,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:07:19,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:07:19,713 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:07:19,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:07:19,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:07:19,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:07:19,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:07:19,713 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:07:19,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:07:19,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:07:19,714 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:07:19,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:07:19,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:07:19,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:07:19,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:07:19,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:07:19,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:07:19,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:19,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:07:19,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:19,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:07:19,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:07:19,716 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 -> 5fa3500dbb7b48d33bda6025d194df10b5d868e3a16ab8452fef68790ebc5c6f [2025-01-09 06:07:19,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:07:19,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:07:19,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:07:19,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:07:19,949 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:07:19,950 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.10.cil-1.c [2025-01-09 06:07:21,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfb823363/261ff3f19fd6425aae4e1560b9935be1/FLAG6d4c8db35 [2025-01-09 06:07:21,482 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:07:21,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c [2025-01-09 06:07:21,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfb823363/261ff3f19fd6425aae4e1560b9935be1/FLAG6d4c8db35 [2025-01-09 06:07:21,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfb823363/261ff3f19fd6425aae4e1560b9935be1 [2025-01-09 06:07:21,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:07:21,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:07:21,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:07:21,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:07:21,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:07:21,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:07:21" (1/1) ... [2025-01-09 06:07:21,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588120c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:21, skipping insertion in model container [2025-01-09 06:07:21,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:07:21" (1/1) ... [2025-01-09 06:07:21,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:07:22,001 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.10.cil-1.c[911,924] [2025-01-09 06:07:22,069 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.10.cil-1.c[8416,8429] [2025-01-09 06:07:22,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:07:22,211 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:07:22,224 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.10.cil-1.c[911,924] [2025-01-09 06:07:22,251 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.10.cil-1.c[8416,8429] [2025-01-09 06:07:22,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:07:22,350 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:07:22,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22 WrapperNode [2025-01-09 06:07:22,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:07:22,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:07:22,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:07:22,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:07:22,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,440 INFO L138 Inliner]: procedures = 75, calls = 92, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 941 [2025-01-09 06:07:22,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:07:22,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:07:22,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:07:22,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:07:22,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 06:07:22,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:07:22,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:07:22,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:07:22,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:07:22,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (1/1) ... [2025-01-09 06:07:22,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:22,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:07:22,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:07:22,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:07:22,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:07:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:07:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:07:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:07:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:07:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:07:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:07:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:07:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:07:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:07:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:07:22,713 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:07:22,714 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:07:23,406 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:07:23,406 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: 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-01-09 06:07:23,529 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-01-09 06:07:23,530 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:07:23,542 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:07:23,543 INFO L312 CfgBuilder]: Removed 17 assume(true) statements. [2025-01-09 06:07:23,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:23 BoogieIcfgContainer [2025-01-09 06:07:23,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:07:23,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:07:23,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:07:23,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:07:23,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:07:21" (1/3) ... [2025-01-09 06:07:23,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269a31ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:23, skipping insertion in model container [2025-01-09 06:07:23,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:22" (2/3) ... [2025-01-09 06:07:23,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269a31ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:23, skipping insertion in model container [2025-01-09 06:07:23,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:23" (3/3) ... [2025-01-09 06:07:23,550 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.10.cil-1.c [2025-01-09 06:07:23,561 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:07:23,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.10.cil-1.c that has 16 procedures, 451 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-01-09 06:07:23,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:07:23,630 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;@26284067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:07:23,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:07:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 451 states, 393 states have (on average 1.5928753180661577) internal successors, (626), 399 states have internal predecessors, (626), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 06:07:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:23,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:23,652 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] [2025-01-09 06:07:23,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash 336271422, now seen corresponding path program 1 times [2025-01-09 06:07:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:23,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50025872] [2025-01-09 06:07:23,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:23,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:23,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:23,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:23,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50025872] [2025-01-09 06:07:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50025872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:24,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:24,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512537964] [2025-01-09 06:07:24,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:24,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:24,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:24,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:24,057 INFO L87 Difference]: Start difference. First operand has 451 states, 393 states have (on average 1.5928753180661577) internal successors, (626), 399 states have internal predecessors, (626), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-01-09 06:07:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:24,804 INFO L93 Difference]: Finished difference Result 990 states and 1555 transitions. [2025-01-09 06:07:24,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:24,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2025-01-09 06:07:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:24,815 INFO L225 Difference]: With dead ends: 990 [2025-01-09 06:07:24,815 INFO L226 Difference]: Without dead ends: 555 [2025-01-09 06:07:24,819 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-01-09 06:07:24,820 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 477 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:24,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1454 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-01-09 06:07:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 548. [2025-01-09 06:07:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 469 states have (on average 1.535181236673774) internal successors, (720), 476 states have internal predecessors, (720), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2025-01-09 06:07:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 831 transitions. [2025-01-09 06:07:24,918 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 831 transitions. Word has length 63 [2025-01-09 06:07:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:24,919 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 831 transitions. [2025-01-09 06:07:24,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-01-09 06:07:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 831 transitions. [2025-01-09 06:07:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:24,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:24,923 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] [2025-01-09 06:07:24,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:07:24,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:24,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1950247170, now seen corresponding path program 1 times [2025-01-09 06:07:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561889934] [2025-01-09 06:07:24,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:24,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:24,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:24,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:24,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561889934] [2025-01-09 06:07:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561889934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:25,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:25,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630731379] [2025-01-09 06:07:25,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:25,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:25,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:25,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:25,139 INFO L87 Difference]: Start difference. First operand 548 states and 831 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-01-09 06:07:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:25,974 INFO L93 Difference]: Finished difference Result 903 states and 1334 transitions. [2025-01-09 06:07:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:25,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2025-01-09 06:07:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:25,978 INFO L225 Difference]: With dead ends: 903 [2025-01-09 06:07:25,978 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 06:07:25,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:25,980 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 979 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:25,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1703 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:07:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 06:07:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 656. [2025-01-09 06:07:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 555 states have (on average 1.5171171171171172) internal successors, (842), 564 states have internal predecessors, (842), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2025-01-09 06:07:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 987 transitions. [2025-01-09 06:07:26,028 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 987 transitions. Word has length 63 [2025-01-09 06:07:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:26,028 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 987 transitions. [2025-01-09 06:07:26,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-01-09 06:07:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 987 transitions. [2025-01-09 06:07:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:26,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:26,030 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] [2025-01-09 06:07:26,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:07:26,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:26,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1965765888, now seen corresponding path program 1 times [2025-01-09 06:07:26,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:26,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302006514] [2025-01-09 06:07:26,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:26,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:26,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:26,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:26,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302006514] [2025-01-09 06:07:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302006514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:26,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:26,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155968346] [2025-01-09 06:07:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:26,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:26,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:26,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:26,113 INFO L87 Difference]: Start difference. First operand 656 states and 987 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:26,366 INFO L93 Difference]: Finished difference Result 1526 states and 2233 transitions. [2025-01-09 06:07:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-01-09 06:07:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:26,377 INFO L225 Difference]: With dead ends: 1526 [2025-01-09 06:07:26,377 INFO L226 Difference]: Without dead ends: 1223 [2025-01-09 06:07:26,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:26,380 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 769 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:26,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1504 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:07:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-01-09 06:07:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1206. [2025-01-09 06:07:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 995 states have (on average 1.4572864321608041) internal successors, (1450), 1012 states have internal predecessors, (1450), 128 states have call successors, (128), 71 states have call predecessors, (128), 81 states have return successors, (162), 126 states have call predecessors, (162), 124 states have call successors, (162) [2025-01-09 06:07:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1740 transitions. [2025-01-09 06:07:26,504 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1740 transitions. Word has length 63 [2025-01-09 06:07:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:26,504 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1740 transitions. [2025-01-09 06:07:26,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1740 transitions. [2025-01-09 06:07:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:07:26,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:26,509 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] [2025-01-09 06:07:26,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:07:26,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:26,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1838713157, now seen corresponding path program 1 times [2025-01-09 06:07:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:26,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799185215] [2025-01-09 06:07:26,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:26,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:07:26,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:07:26,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:26,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:26,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799185215] [2025-01-09 06:07:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799185215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:26,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:26,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:26,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049126323] [2025-01-09 06:07:26,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:26,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:26,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:26,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:26,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:26,613 INFO L87 Difference]: Start difference. First operand 1206 states and 1740 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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-01-09 06:07:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:26,703 INFO L93 Difference]: Finished difference Result 2079 states and 2974 transitions. [2025-01-09 06:07:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2025-01-09 06:07:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:26,711 INFO L225 Difference]: With dead ends: 2079 [2025-01-09 06:07:26,711 INFO L226 Difference]: Without dead ends: 1226 [2025-01-09 06:07:26,715 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-01-09 06:07:26,716 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 0 mSDsluCounter, 2690 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3364 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-01-09 06:07:26,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3364 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-01-09 06:07:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1226. [2025-01-09 06:07:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1011 states have (on average 1.4451038575667656) internal successors, (1461), 1028 states have internal predecessors, (1461), 128 states have call successors, (128), 71 states have call predecessors, (128), 85 states have return successors, (169), 130 states have call predecessors, (169), 124 states have call successors, (169) [2025-01-09 06:07:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1758 transitions. [2025-01-09 06:07:26,800 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1758 transitions. Word has length 64 [2025-01-09 06:07:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:26,800 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1758 transitions. [2025-01-09 06:07:26,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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-01-09 06:07:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1758 transitions. [2025-01-09 06:07:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:07:26,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:26,802 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] [2025-01-09 06:07:26,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:07:26,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:26,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2061887353, now seen corresponding path program 1 times [2025-01-09 06:07:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:26,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045967920] [2025-01-09 06:07:26,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:26,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:07:26,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:07:26,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:26,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045967920] [2025-01-09 06:07:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045967920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:26,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080720742] [2025-01-09 06:07:26,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:26,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:26,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:26,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:26,913 INFO L87 Difference]: Start difference. First operand 1226 states and 1758 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:27,414 INFO L93 Difference]: Finished difference Result 3688 states and 5195 transitions. [2025-01-09 06:07:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:07:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-01-09 06:07:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:27,424 INFO L225 Difference]: With dead ends: 3688 [2025-01-09 06:07:27,425 INFO L226 Difference]: Without dead ends: 1516 [2025-01-09 06:07:27,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:27,431 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 1791 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:27,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 2712 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2025-01-09 06:07:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1151. [2025-01-09 06:07:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 936 states have (on average 1.4177350427350428) internal successors, (1327), 953 states have internal predecessors, (1327), 128 states have call successors, (128), 71 states have call predecessors, (128), 85 states have return successors, (157), 130 states have call predecessors, (157), 124 states have call successors, (157) [2025-01-09 06:07:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1612 transitions. [2025-01-09 06:07:27,495 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1612 transitions. Word has length 64 [2025-01-09 06:07:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:27,496 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1612 transitions. [2025-01-09 06:07:27,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1612 transitions. [2025-01-09 06:07:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:27,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:27,497 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-01-09 06:07:27,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:07:27,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:27,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 484923631, now seen corresponding path program 1 times [2025-01-09 06:07:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679067219] [2025-01-09 06:07:27,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:27,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:27,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:27,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:27,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:27,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679067219] [2025-01-09 06:07:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679067219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:27,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887475521] [2025-01-09 06:07:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:27,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:27,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:27,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:27,594 INFO L87 Difference]: Start difference. First operand 1151 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:27,646 INFO L93 Difference]: Finished difference Result 1994 states and 2739 transitions. [2025-01-09 06:07:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-01-09 06:07:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:27,652 INFO L225 Difference]: With dead ends: 1994 [2025-01-09 06:07:27,652 INFO L226 Difference]: Without dead ends: 1196 [2025-01-09 06:07:27,654 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-01-09 06:07:27,654 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 0 mSDsluCounter, 2659 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3325 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-01-09 06:07:27,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-01-09 06:07:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1196. [2025-01-09 06:07:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 972 states have (on average 1.4022633744855968) internal successors, (1363), 989 states have internal predecessors, (1363), 128 states have call successors, (128), 71 states have call predecessors, (128), 94 states have return successors, (166), 139 states have call predecessors, (166), 124 states have call successors, (166) [2025-01-09 06:07:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1657 transitions. [2025-01-09 06:07:27,702 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1657 transitions. Word has length 65 [2025-01-09 06:07:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:27,703 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1657 transitions. [2025-01-09 06:07:27,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1657 transitions. [2025-01-09 06:07:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:27,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:27,704 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-01-09 06:07:27,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:07:27,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:27,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1886815631, now seen corresponding path program 1 times [2025-01-09 06:07:27,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:27,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102244393] [2025-01-09 06:07:27,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:27,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:27,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:27,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:27,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:27,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:27,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:27,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102244393] [2025-01-09 06:07:27,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102244393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:27,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:27,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301636935] [2025-01-09 06:07:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:27,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:27,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:27,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:27,851 INFO L87 Difference]: Start difference. First operand 1196 states and 1657 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-01-09 06:07:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:29,102 INFO L93 Difference]: Finished difference Result 2093 states and 2807 transitions. [2025-01-09 06:07:29,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:07:29,102 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-01-09 06:07:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:29,108 INFO L225 Difference]: With dead ends: 2093 [2025-01-09 06:07:29,108 INFO L226 Difference]: Without dead ends: 1335 [2025-01-09 06:07:29,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:07:29,111 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 979 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:29,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1424 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 06:07:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-01-09 06:07:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1205. [2025-01-09 06:07:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 981 states have (on average 1.3965341488277268) internal successors, (1370), 996 states have internal predecessors, (1370), 129 states have call successors, (129), 72 states have call predecessors, (129), 93 states have return successors, (161), 140 states have call predecessors, (161), 125 states have call successors, (161) [2025-01-09 06:07:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1660 transitions. [2025-01-09 06:07:29,162 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1660 transitions. Word has length 65 [2025-01-09 06:07:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:29,162 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1660 transitions. [2025-01-09 06:07:29,163 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-01-09 06:07:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1660 transitions. [2025-01-09 06:07:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:29,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:29,166 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-01-09 06:07:29,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:07:29,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:29,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1667960913, now seen corresponding path program 1 times [2025-01-09 06:07:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:29,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153447729] [2025-01-09 06:07:29,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:29,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:29,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:29,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:29,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:29,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:29,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153447729] [2025-01-09 06:07:29,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153447729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:29,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:29,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:29,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894347311] [2025-01-09 06:07:29,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:29,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:29,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:29,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:29,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:29,228 INFO L87 Difference]: Start difference. First operand 1205 states and 1660 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:29,796 INFO L93 Difference]: Finished difference Result 2895 states and 3894 transitions. [2025-01-09 06:07:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:07:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-01-09 06:07:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:29,806 INFO L225 Difference]: With dead ends: 2895 [2025-01-09 06:07:29,806 INFO L226 Difference]: Without dead ends: 2046 [2025-01-09 06:07:29,808 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-01-09 06:07:29,809 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 934 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:29,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 725 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2025-01-09 06:07:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2036. [2025-01-09 06:07:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 1617 states have (on average 1.3450834879406308) internal successors, (2175), 1645 states have internal predecessors, (2175), 233 states have call successors, (233), 136 states have call predecessors, (233), 184 states have return successors, (338), 261 states have call predecessors, (338), 229 states have call successors, (338) [2025-01-09 06:07:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2746 transitions. [2025-01-09 06:07:29,915 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2746 transitions. Word has length 65 [2025-01-09 06:07:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:29,915 INFO L471 AbstractCegarLoop]: Abstraction has 2036 states and 2746 transitions. [2025-01-09 06:07:29,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2746 transitions. [2025-01-09 06:07:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:07:29,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:29,917 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-01-09 06:07:29,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:07:29,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:29,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:29,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1686702830, now seen corresponding path program 1 times [2025-01-09 06:07:29,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:29,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171239961] [2025-01-09 06:07:29,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:29,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:29,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:07:29,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:07:29,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:29,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:29,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:29,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171239961] [2025-01-09 06:07:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171239961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:29,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092879123] [2025-01-09 06:07:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:29,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:29,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:29,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:29,950 INFO L87 Difference]: Start difference. First operand 2036 states and 2746 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:30,013 INFO L93 Difference]: Finished difference Result 3580 states and 4834 transitions. [2025-01-09 06:07:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:30,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-01-09 06:07:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:30,017 INFO L225 Difference]: With dead ends: 3580 [2025-01-09 06:07:30,017 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 06:07:30,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:30,024 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 636 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:30,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 653 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 06:07:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-01-09 06:07:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 300 states have (on average 1.58) internal successors, (474), 302 states have internal predecessors, (474), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 06:07:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 524 transitions. [2025-01-09 06:07:30,075 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 524 transitions. Word has length 66 [2025-01-09 06:07:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:30,075 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 524 transitions. [2025-01-09 06:07:30,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 524 transitions. [2025-01-09 06:07:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:30,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:30,076 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] [2025-01-09 06:07:30,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:07:30,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:30,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash -935930780, now seen corresponding path program 1 times [2025-01-09 06:07:30,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:30,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981146746] [2025-01-09 06:07:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:30,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:30,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:30,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:30,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:30,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981146746] [2025-01-09 06:07:30,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981146746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:30,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:30,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722363611] [2025-01-09 06:07:30,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:30,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:30,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:30,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:30,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:30,125 INFO L87 Difference]: Start difference. First operand 333 states and 524 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:30,136 INFO L93 Difference]: Finished difference Result 654 states and 1029 transitions. [2025-01-09 06:07:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:30,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2025-01-09 06:07:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:30,139 INFO L225 Difference]: With dead ends: 654 [2025-01-09 06:07:30,140 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 06:07:30,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:30,141 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 512 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:30,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 523 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 06:07:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-01-09 06:07:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 300 states have (on average 1.5766666666666667) internal successors, (473), 302 states have internal predecessors, (473), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 06:07:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 523 transitions. [2025-01-09 06:07:30,153 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 523 transitions. Word has length 155 [2025-01-09 06:07:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:30,153 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 523 transitions. [2025-01-09 06:07:30,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 523 transitions. [2025-01-09 06:07:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:30,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:30,156 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] [2025-01-09 06:07:30,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:07:30,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -395501274, now seen corresponding path program 1 times [2025-01-09 06:07:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118701797] [2025-01-09 06:07:30,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:30,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:30,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:30,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118701797] [2025-01-09 06:07:30,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118701797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:30,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:30,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161761190] [2025-01-09 06:07:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:30,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:30,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:30,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:30,257 INFO L87 Difference]: Start difference. First operand 333 states and 523 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:30,734 INFO L93 Difference]: Finished difference Result 1001 states and 1589 transitions. [2025-01-09 06:07:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:30,738 INFO L225 Difference]: With dead ends: 1001 [2025-01-09 06:07:30,738 INFO L226 Difference]: Without dead ends: 687 [2025-01-09 06:07:30,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:30,740 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 993 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:30,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1442 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-01-09 06:07:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 660. [2025-01-09 06:07:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 601 states have (on average 1.589018302828619) internal successors, (955), 604 states have internal predecessors, (955), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-01-09 06:07:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1044 transitions. [2025-01-09 06:07:30,760 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1044 transitions. Word has length 155 [2025-01-09 06:07:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:30,761 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1044 transitions. [2025-01-09 06:07:30,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1044 transitions. [2025-01-09 06:07:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:30,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:30,762 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] [2025-01-09 06:07:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:07:30,763 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:30,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:30,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2012941724, now seen corresponding path program 1 times [2025-01-09 06:07:30,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:30,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625777349] [2025-01-09 06:07:30,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:30,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:30,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:30,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:30,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625777349] [2025-01-09 06:07:30,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625777349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:30,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:30,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:30,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178918826] [2025-01-09 06:07:30,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:30,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:30,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:30,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:30,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:30,911 INFO L87 Difference]: Start difference. First operand 660 states and 1044 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:31,643 INFO L93 Difference]: Finished difference Result 1720 states and 2752 transitions. [2025-01-09 06:07:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:31,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:31,649 INFO L225 Difference]: With dead ends: 1720 [2025-01-09 06:07:31,649 INFO L226 Difference]: Without dead ends: 1079 [2025-01-09 06:07:31,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:31,651 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 998 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:31,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 2783 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:07:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-01-09 06:07:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 964. [2025-01-09 06:07:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 879 states have (on average 1.5824800910125143) internal successors, (1391), 883 states have internal predecessors, (1391), 64 states have call successors, (64), 19 states have call predecessors, (64), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-01-09 06:07:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1521 transitions. [2025-01-09 06:07:31,683 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1521 transitions. Word has length 155 [2025-01-09 06:07:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:31,683 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1521 transitions. [2025-01-09 06:07:31,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1521 transitions. [2025-01-09 06:07:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:31,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:31,685 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] [2025-01-09 06:07:31,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:07:31,685 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:31,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1649475226, now seen corresponding path program 1 times [2025-01-09 06:07:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:31,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317679370] [2025-01-09 06:07:31,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:31,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:31,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:31,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:31,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:31,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:31,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317679370] [2025-01-09 06:07:31,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317679370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:31,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:31,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321781140] [2025-01-09 06:07:31,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:31,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:31,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:31,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:31,842 INFO L87 Difference]: Start difference. First operand 964 states and 1521 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:32,692 INFO L93 Difference]: Finished difference Result 2690 states and 4298 transitions. [2025-01-09 06:07:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:32,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:32,708 INFO L225 Difference]: With dead ends: 2690 [2025-01-09 06:07:32,708 INFO L226 Difference]: Without dead ends: 1745 [2025-01-09 06:07:32,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-01-09 06:07:32,713 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 993 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:32,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 2767 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:07:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-01-09 06:07:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1613. [2025-01-09 06:07:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1474 states have (on average 1.5861601085481682) internal successors, (2338), 1482 states have internal predecessors, (2338), 102 states have call successors, (102), 31 states have call predecessors, (102), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-01-09 06:07:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2556 transitions. [2025-01-09 06:07:32,770 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2556 transitions. Word has length 155 [2025-01-09 06:07:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:32,770 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2556 transitions. [2025-01-09 06:07:32,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2556 transitions. [2025-01-09 06:07:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:32,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:32,774 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] [2025-01-09 06:07:32,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:07:32,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:32,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:32,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1360655836, now seen corresponding path program 1 times [2025-01-09 06:07:32,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:32,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484574710] [2025-01-09 06:07:32,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:32,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:32,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:32,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:32,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:32,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:32,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484574710] [2025-01-09 06:07:32,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484574710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:32,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796961608] [2025-01-09 06:07:32,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:32,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:32,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:32,907 INFO L87 Difference]: Start difference. First operand 1613 states and 2556 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:33,576 INFO L93 Difference]: Finished difference Result 4789 states and 7711 transitions. [2025-01-09 06:07:33,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:33,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:33,589 INFO L225 Difference]: With dead ends: 4789 [2025-01-09 06:07:33,589 INFO L226 Difference]: Without dead ends: 3195 [2025-01-09 06:07:33,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:33,594 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 988 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:33,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 2755 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2025-01-09 06:07:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3028. [2025-01-09 06:07:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 2775 states have (on average 1.6021621621621622) internal successors, (4446), 2797 states have internal predecessors, (4446), 178 states have call successors, (178), 55 states have call predecessors, (178), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-01-09 06:07:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 4864 transitions. [2025-01-09 06:07:33,716 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 4864 transitions. Word has length 155 [2025-01-09 06:07:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:33,716 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 4864 transitions. [2025-01-09 06:07:33,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 4864 transitions. [2025-01-09 06:07:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:33,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:33,719 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] [2025-01-09 06:07:33,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:07:33,719 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:33,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1905528410, now seen corresponding path program 1 times [2025-01-09 06:07:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:33,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626989479] [2025-01-09 06:07:33,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:33,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:33,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:33,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:33,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:33,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626989479] [2025-01-09 06:07:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626989479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:33,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081023955] [2025-01-09 06:07:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:33,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:33,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:33,835 INFO L87 Difference]: Start difference. First operand 3028 states and 4864 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:34,641 INFO L93 Difference]: Finished difference Result 9436 states and 15477 transitions. [2025-01-09 06:07:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:34,675 INFO L225 Difference]: With dead ends: 9436 [2025-01-09 06:07:34,676 INFO L226 Difference]: Without dead ends: 6427 [2025-01-09 06:07:34,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:34,686 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 983 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:34,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 2743 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6427 states. [2025-01-09 06:07:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6427 to 6191. [2025-01-09 06:07:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6191 states, 5692 states have (on average 1.6286015460295151) internal successors, (9270), 5760 states have internal predecessors, (9270), 330 states have call successors, (330), 103 states have call predecessors, (330), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-01-09 06:07:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 10184 transitions. [2025-01-09 06:07:35,043 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 10184 transitions. Word has length 155 [2025-01-09 06:07:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:35,043 INFO L471 AbstractCegarLoop]: Abstraction has 6191 states and 10184 transitions. [2025-01-09 06:07:35,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 10184 transitions. [2025-01-09 06:07:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:35,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:35,048 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] [2025-01-09 06:07:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:07:35,048 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:35,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1230368284, now seen corresponding path program 1 times [2025-01-09 06:07:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326392412] [2025-01-09 06:07:35,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:35,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:35,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:35,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:35,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326392412] [2025-01-09 06:07:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326392412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:35,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:35,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308504648] [2025-01-09 06:07:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:35,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:35,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:35,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:35,241 INFO L87 Difference]: Start difference. First operand 6191 states and 10184 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:35,846 INFO L93 Difference]: Finished difference Result 13857 states and 23368 transitions. [2025-01-09 06:07:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:35,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:35,891 INFO L225 Difference]: With dead ends: 13857 [2025-01-09 06:07:35,891 INFO L226 Difference]: Without dead ends: 7685 [2025-01-09 06:07:35,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:35,914 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 702 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:35,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1025 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:07:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7685 states. [2025-01-09 06:07:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7685 to 6191. [2025-01-09 06:07:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6191 states, 5692 states have (on average 1.6256148981026002) internal successors, (9253), 5760 states have internal predecessors, (9253), 330 states have call successors, (330), 103 states have call predecessors, (330), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-01-09 06:07:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 10167 transitions. [2025-01-09 06:07:36,326 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 10167 transitions. Word has length 155 [2025-01-09 06:07:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:36,327 INFO L471 AbstractCegarLoop]: Abstraction has 6191 states and 10167 transitions. [2025-01-09 06:07:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 10167 transitions. [2025-01-09 06:07:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:36,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:36,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:07:36,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2116547046, now seen corresponding path program 1 times [2025-01-09 06:07:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141809921] [2025-01-09 06:07:36,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:36,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:36,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:36,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:36,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:36,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141809921] [2025-01-09 06:07:36,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141809921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:36,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:36,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193052919] [2025-01-09 06:07:36,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:36,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:36,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:36,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:36,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:36,435 INFO L87 Difference]: Start difference. First operand 6191 states and 10167 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:36,993 INFO L93 Difference]: Finished difference Result 13691 states and 23002 transitions. [2025-01-09 06:07:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:37,036 INFO L225 Difference]: With dead ends: 13691 [2025-01-09 06:07:37,037 INFO L226 Difference]: Without dead ends: 7519 [2025-01-09 06:07:37,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:37,057 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 698 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:37,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1011 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:07:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7519 states. [2025-01-09 06:07:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7519 to 6191. [2025-01-09 06:07:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6191 states, 5692 states have (on average 1.6226282501756852) internal successors, (9236), 5760 states have internal predecessors, (9236), 330 states have call successors, (330), 103 states have call predecessors, (330), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-01-09 06:07:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 10150 transitions. [2025-01-09 06:07:37,443 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 10150 transitions. Word has length 155 [2025-01-09 06:07:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:37,443 INFO L471 AbstractCegarLoop]: Abstraction has 6191 states and 10150 transitions. [2025-01-09 06:07:37,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 10150 transitions. [2025-01-09 06:07:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:37,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:37,449 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] [2025-01-09 06:07:37,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:07:37,449 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:37,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:37,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1682041448, now seen corresponding path program 1 times [2025-01-09 06:07:37,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:37,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050407024] [2025-01-09 06:07:37,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:37,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:37,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:37,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:37,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050407024] [2025-01-09 06:07:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050407024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:37,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195353430] [2025-01-09 06:07:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:37,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:37,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:37,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:37,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:37,597 INFO L87 Difference]: Start difference. First operand 6191 states and 10150 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:38,660 INFO L93 Difference]: Finished difference Result 19703 states and 33105 transitions. [2025-01-09 06:07:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:38,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:38,721 INFO L225 Difference]: With dead ends: 19703 [2025-01-09 06:07:38,722 INFO L226 Difference]: Without dead ends: 13531 [2025-01-09 06:07:38,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:38,744 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 994 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:38,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1892 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13531 states. [2025-01-09 06:07:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13531 to 13219. [2025-01-09 06:07:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13219 states, 12174 states have (on average 1.6499096435025464) internal successors, (20086), 12388 states have internal predecessors, (20086), 634 states have call successors, (634), 199 states have call predecessors, (634), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-01-09 06:07:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13219 states to 13219 states and 22376 transitions. [2025-01-09 06:07:39,262 INFO L78 Accepts]: Start accepts. Automaton has 13219 states and 22376 transitions. Word has length 155 [2025-01-09 06:07:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:39,262 INFO L471 AbstractCegarLoop]: Abstraction has 13219 states and 22376 transitions. [2025-01-09 06:07:39,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 13219 states and 22376 transitions. [2025-01-09 06:07:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:39,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:39,335 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] [2025-01-09 06:07:39,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:07:39,336 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:39,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:39,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1252383142, now seen corresponding path program 1 times [2025-01-09 06:07:39,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:39,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132691614] [2025-01-09 06:07:39,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:39,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:39,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:39,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:39,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:39,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132691614] [2025-01-09 06:07:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132691614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:39,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:39,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633346348] [2025-01-09 06:07:39,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:39,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:39,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:39,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:39,441 INFO L87 Difference]: Start difference. First operand 13219 states and 22376 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:40,669 INFO L93 Difference]: Finished difference Result 29849 states and 51938 transitions. [2025-01-09 06:07:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:40,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:40,756 INFO L225 Difference]: With dead ends: 29849 [2025-01-09 06:07:40,756 INFO L226 Difference]: Without dead ends: 16649 [2025-01-09 06:07:40,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:40,803 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 694 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:40,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 997 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:07:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16649 states. [2025-01-09 06:07:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16649 to 13219. [2025-01-09 06:07:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13219 states, 12174 states have (on average 1.6471989485789387) internal successors, (20053), 12388 states have internal predecessors, (20053), 634 states have call successors, (634), 199 states have call predecessors, (634), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-01-09 06:07:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13219 states to 13219 states and 22343 transitions. [2025-01-09 06:07:41,583 INFO L78 Accepts]: Start accepts. Automaton has 13219 states and 22343 transitions. Word has length 155 [2025-01-09 06:07:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:41,584 INFO L471 AbstractCegarLoop]: Abstraction has 13219 states and 22343 transitions. [2025-01-09 06:07:41,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 13219 states and 22343 transitions. [2025-01-09 06:07:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:41,593 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:41,593 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] [2025-01-09 06:07:41,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:07:41,593 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:41,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 545786536, now seen corresponding path program 1 times [2025-01-09 06:07:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424911119] [2025-01-09 06:07:41,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:41,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:41,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:41,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:41,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:41,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:41,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424911119] [2025-01-09 06:07:41,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424911119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:41,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:41,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:41,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631705652] [2025-01-09 06:07:41,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:41,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:41,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:41,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:41,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:41,737 INFO L87 Difference]: Start difference. First operand 13219 states and 22343 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:43,091 INFO L93 Difference]: Finished difference Result 42901 states and 74946 transitions. [2025-01-09 06:07:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:43,197 INFO L225 Difference]: With dead ends: 42901 [2025-01-09 06:07:43,198 INFO L226 Difference]: Without dead ends: 29701 [2025-01-09 06:07:43,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:43,244 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 946 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:43,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 2648 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29701 states. [2025-01-09 06:07:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29701 to 29219. [2025-01-09 06:07:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29219 states, 26920 states have (on average 1.675594353640416) internal successors, (45107), 27588 states have internal predecessors, (45107), 1242 states have call successors, (1242), 391 states have call predecessors, (1242), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-01-09 06:07:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29219 states to 29219 states and 51685 transitions. [2025-01-09 06:07:45,066 INFO L78 Accepts]: Start accepts. Automaton has 29219 states and 51685 transitions. Word has length 155 [2025-01-09 06:07:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:45,067 INFO L471 AbstractCegarLoop]: Abstraction has 29219 states and 51685 transitions. [2025-01-09 06:07:45,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29219 states and 51685 transitions. [2025-01-09 06:07:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:45,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:45,078 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] [2025-01-09 06:07:45,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:07:45,080 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:45,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1492824422, now seen corresponding path program 1 times [2025-01-09 06:07:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756222027] [2025-01-09 06:07:45,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:45,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:45,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:45,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:45,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:45,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756222027] [2025-01-09 06:07:45,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756222027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:45,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:45,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:45,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173247617] [2025-01-09 06:07:45,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:45,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:45,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:45,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:45,199 INFO L87 Difference]: Start difference. First operand 29219 states and 51685 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:48,705 INFO L93 Difference]: Finished difference Result 101639 states and 186863 transitions. [2025-01-09 06:07:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:48,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:07:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:49,281 INFO L225 Difference]: With dead ends: 101639 [2025-01-09 06:07:49,282 INFO L226 Difference]: Without dead ends: 72439 [2025-01-09 06:07:49,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:49,387 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 1044 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:49,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 2623 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:07:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72439 states. [2025-01-09 06:07:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72439 to 66616. [2025-01-09 06:07:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66616 states, 61387 states have (on average 1.7067945982048316) internal successors, (104775), 63449 states have internal predecessors, (104775), 2394 states have call successors, (2394), 775 states have call predecessors, (2394), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-01-09 06:07:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66616 states to 66616 states and 125945 transitions. [2025-01-09 06:07:53,646 INFO L78 Accepts]: Start accepts. Automaton has 66616 states and 125945 transitions. Word has length 155 [2025-01-09 06:07:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:53,646 INFO L471 AbstractCegarLoop]: Abstraction has 66616 states and 125945 transitions. [2025-01-09 06:07:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 66616 states and 125945 transitions. [2025-01-09 06:07:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:07:53,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:53,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:07:53,671 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:53,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1940309272, now seen corresponding path program 1 times [2025-01-09 06:07:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:53,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267195793] [2025-01-09 06:07:53,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:53,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:07:53,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:07:53,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:53,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:53,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267195793] [2025-01-09 06:07:53,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267195793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:53,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:53,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811787289] [2025-01-09 06:07:53,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:53,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:53,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:53,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:53,809 INFO L87 Difference]: Start difference. First operand 66616 states and 125945 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:08:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:01,960 INFO L93 Difference]: Finished difference Result 233552 states and 467561 transitions. [2025-01-09 06:08:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:08:01,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:08:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:03,056 INFO L225 Difference]: With dead ends: 233552 [2025-01-09 06:08:03,056 INFO L226 Difference]: Without dead ends: 166955 [2025-01-09 06:08:03,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:08:03,398 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1219 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:03,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 2607 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:08:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166955 states.