./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.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_2.cil-1+token_ring.05.cil-2.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 8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:04:04,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:04:04,459 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:04:04,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:04:04,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:04:04,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:04:04,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:04:04,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:04:04,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:04:04,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:04:04,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:04:04,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:04:04,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:04:04,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:04:04,505 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:04:04,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:04:04,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:04:04,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:04:04,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:04:04,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:04:04,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:04:04,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:04:04,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:04:04,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:04:04,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:04:04,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:04:04,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:04:04,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:04:04,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:04:04,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:04:04,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:04:04,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:04:04,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:04,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:04:04,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:04:04,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:04:04,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:04:04,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:04,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:04:04,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:04:04,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:04:04,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:04:04,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:04:04,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:04:04,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:04:04,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:04:04,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:04:04,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:04:04,509 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 -> 8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16 [2025-01-09 06:04:04,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:04:04,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:04:04,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:04:04,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:04:04,899 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:04:04,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2025-01-09 06:04:06,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6978c2294/2eb9889e54404d13a202a991868e909d/FLAGeec402931 [2025-01-09 06:04:06,634 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:04:06,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2025-01-09 06:04:06,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6978c2294/2eb9889e54404d13a202a991868e909d/FLAGeec402931 [2025-01-09 06:04:06,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6978c2294/2eb9889e54404d13a202a991868e909d [2025-01-09 06:04:06,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:04:06,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:04:06,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:04:06,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:04:06,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:04:06,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:04:06" (1/1) ... [2025-01-09 06:04:06,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1b8949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:06, skipping insertion in model container [2025-01-09 06:04:06,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:04:06" (1/1) ... [2025-01-09 06:04:06,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:04:06,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c[914,927] [2025-01-09 06:04:06,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c[7115,7128] [2025-01-09 06:04:07,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:04:07,056 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:04:07,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c[914,927] [2025-01-09 06:04:07,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c[7115,7128] [2025-01-09 06:04:07,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:04:07,161 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:04:07,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07 WrapperNode [2025-01-09 06:04:07,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:04:07,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:04:07,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:04:07,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:04:07,171 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:04:07" (1/1) ... [2025-01-09 06:04:07,180 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:04:07" (1/1) ... [2025-01-09 06:04:07,223 INFO L138 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 618 [2025-01-09 06:04:07,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:04:07,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:04:07,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:04:07,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:04:07,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,254 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:04:07,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:04:07,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:04:07,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:04:07,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:04:07,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (1/1) ... [2025-01-09 06:04:07,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:07,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:04:07,327 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:04:07,330 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:04:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:04:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:04:07,354 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:04:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:04:07,354 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:04:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:04:07,354 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:04:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:04:07,354 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:04:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:04:07,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:04:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:04:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:04:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:04:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:04:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:04:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:04:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:04:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:04:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:04:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:04:07,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:04:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:04:07,356 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:04:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:04:07,356 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:04:07,466 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:04:07,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:04:08,258 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-01-09 06:04:08,258 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:04:08,282 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:04:08,283 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2025-01-09 06:04:08,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:04:08 BoogieIcfgContainer [2025-01-09 06:04:08,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:04:08,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:04:08,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:04:08,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:04:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:04:06" (1/3) ... [2025-01-09 06:04:08,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebd42f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:04:08, skipping insertion in model container [2025-01-09 06:04:08,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:07" (2/3) ... [2025-01-09 06:04:08,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebd42f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:04:08, skipping insertion in model container [2025-01-09 06:04:08,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:04:08" (3/3) ... [2025-01-09 06:04:08,295 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2025-01-09 06:04:08,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:04:08,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.05.cil-2.c that has 16 procedures, 310 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-01-09 06:04:08,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:04:08,417 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;@32cf19b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:04:08,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:04:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 310 states, 259 states have (on average 1.5598455598455598) internal successors, (404), 265 states have internal predecessors, (404), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 06:04:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:08,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:08,436 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] [2025-01-09 06:04:08,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:08,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1998115650, now seen corresponding path program 1 times [2025-01-09 06:04:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:08,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987787259] [2025-01-09 06:04:08,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:08,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:08,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:08,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:08,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:08,753 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:04:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:08,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987787259] [2025-01-09 06:04:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987787259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:08,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:08,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301222552] [2025-01-09 06:04:08,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:08,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:08,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:08,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:08,791 INFO L87 Difference]: Start difference. First operand has 310 states, 259 states have (on average 1.5598455598455598) internal successors, (404), 265 states have internal predecessors, (404), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:04:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:08,891 INFO L93 Difference]: Finished difference Result 598 states and 913 transitions. [2025-01-09 06:04:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:08,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:04:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:08,908 INFO L225 Difference]: With dead ends: 598 [2025-01-09 06:04:08,908 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 06:04:08,913 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:04:08,918 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 126 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 775 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:04:08,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 775 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 06:04:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-01-09 06:04:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 249 states have (on average 1.5220883534136547) internal successors, (379), 254 states have internal predecessors, (379), 35 states have call successors, (35), 15 states have call predecessors, (35), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 06:04:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 445 transitions. [2025-01-09 06:04:09,000 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 445 transitions. Word has length 62 [2025-01-09 06:04:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:09,003 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 445 transitions. [2025-01-09 06:04:09,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:04:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 445 transitions. [2025-01-09 06:04:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:09,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:09,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:04:09,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 459775620, now seen corresponding path program 1 times [2025-01-09 06:04:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:09,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385173531] [2025-01-09 06:04:09,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:09,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:09,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:09,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:09,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:09,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:09,345 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:04:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385173531] [2025-01-09 06:04:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385173531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:09,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:09,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945146294] [2025-01-09 06:04:09,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:09,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:09,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:09,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:09,350 INFO L87 Difference]: Start difference. First operand 299 states and 445 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:04:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:10,073 INFO L93 Difference]: Finished difference Result 482 states and 705 transitions. [2025-01-09 06:04:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:10,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-01-09 06:04:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:10,082 INFO L225 Difference]: With dead ends: 482 [2025-01-09 06:04:10,082 INFO L226 Difference]: Without dead ends: 398 [2025-01-09 06:04:10,083 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:04:10,084 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 331 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:10,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 963 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-01-09 06:04:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 391. [2025-01-09 06:04:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 321 states have (on average 1.4922118380062306) internal successors, (479), 328 states have internal predecessors, (479), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2025-01-09 06:04:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 572 transitions. [2025-01-09 06:04:10,143 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 572 transitions. Word has length 62 [2025-01-09 06:04:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:10,143 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 572 transitions. [2025-01-09 06:04:10,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:04:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 572 transitions. [2025-01-09 06:04:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:10,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:10,147 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] [2025-01-09 06:04:10,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:04:10,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:10,150 INFO L85 PathProgramCache]: Analyzing trace with hash 177936901, now seen corresponding path program 1 times [2025-01-09 06:04:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86406286] [2025-01-09 06:04:10,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:10,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:10,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:10,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:10,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:10,380 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:04:10,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:10,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86406286] [2025-01-09 06:04:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86406286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911059370] [2025-01-09 06:04:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:10,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:10,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:10,383 INFO L87 Difference]: Start difference. First operand 391 states and 572 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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:04:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:11,111 INFO L93 Difference]: Finished difference Result 696 states and 990 transitions. [2025-01-09 06:04:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 62 [2025-01-09 06:04:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:11,115 INFO L225 Difference]: With dead ends: 696 [2025-01-09 06:04:11,116 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 06:04:11,117 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:04:11,117 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 659 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:11,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1021 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 06:04:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 483. [2025-01-09 06:04:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 393 states have (on average 1.470737913486005) internal successors, (578), 402 states have internal predecessors, (578), 57 states have call successors, (57), 29 states have call predecessors, (57), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2025-01-09 06:04:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 701 transitions. [2025-01-09 06:04:11,172 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 701 transitions. Word has length 62 [2025-01-09 06:04:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:11,173 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 701 transitions. [2025-01-09 06:04:11,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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:04:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 701 transitions. [2025-01-09 06:04:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:11,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:11,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:11,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:04:11,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:11,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2117098947, now seen corresponding path program 1 times [2025-01-09 06:04:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777663361] [2025-01-09 06:04:11,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:11,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:11,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:11,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:11,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:11,303 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:04:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777663361] [2025-01-09 06:04:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777663361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:11,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000102299] [2025-01-09 06:04:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:11,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:11,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:11,305 INFO L87 Difference]: Start difference. First operand 483 states and 701 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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:04:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:11,368 INFO L93 Difference]: Finished difference Result 743 states and 1062 transitions. [2025-01-09 06:04:11,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:11,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-01-09 06:04:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:11,374 INFO L225 Difference]: With dead ends: 743 [2025-01-09 06:04:11,374 INFO L226 Difference]: Without dead ends: 488 [2025-01-09 06:04:11,376 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:04:11,377 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2205 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:04:11,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2205 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-01-09 06:04:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-01-09 06:04:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 397 states have (on average 1.4609571788413098) internal successors, (580), 406 states have internal predecessors, (580), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2025-01-09 06:04:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 704 transitions. [2025-01-09 06:04:11,425 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 704 transitions. Word has length 62 [2025-01-09 06:04:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 704 transitions. [2025-01-09 06:04:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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:04:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 704 transitions. [2025-01-09 06:04:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:11,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:11,429 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] [2025-01-09 06:04:11,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:04:11,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:11,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1273093445, now seen corresponding path program 1 times [2025-01-09 06:04:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:11,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024254841] [2025-01-09 06:04:11,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:11,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:11,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:11,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:11,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:11,533 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:04:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024254841] [2025-01-09 06:04:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024254841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:11,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:11,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596401294] [2025-01-09 06:04:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:11,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:11,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:11,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:11,535 INFO L87 Difference]: Start difference. First operand 488 states and 704 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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:04:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:11,605 INFO L93 Difference]: Finished difference Result 763 states and 1080 transitions. [2025-01-09 06:04:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:11,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-01-09 06:04:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:11,610 INFO L225 Difference]: With dead ends: 763 [2025-01-09 06:04:11,610 INFO L226 Difference]: Without dead ends: 503 [2025-01-09 06:04:11,612 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:04:11,613 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2205 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:04:11,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2205 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-09 06:04:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-01-09 06:04:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 409 states have (on average 1.4474327628361858) internal successors, (592), 418 states have internal predecessors, (592), 57 states have call successors, (57), 29 states have call predecessors, (57), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2025-01-09 06:04:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 719 transitions. [2025-01-09 06:04:11,658 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 719 transitions. Word has length 62 [2025-01-09 06:04:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:11,659 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 719 transitions. [2025-01-09 06:04:11,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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:04:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 719 transitions. [2025-01-09 06:04:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:11,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:11,661 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] [2025-01-09 06:04:11,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:04:11,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:11,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1335133059, now seen corresponding path program 1 times [2025-01-09 06:04:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:11,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087420841] [2025-01-09 06:04:11,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:11,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:11,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:11,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:11,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:11,725 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:04:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087420841] [2025-01-09 06:04:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087420841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:11,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:11,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:11,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590300935] [2025-01-09 06:04:11,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:11,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:11,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:11,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:11,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:11,728 INFO L87 Difference]: Start difference. First operand 503 states and 719 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:04:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:12,158 INFO L93 Difference]: Finished difference Result 1048 states and 1449 transitions. [2025-01-09 06:04:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:04:12,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 62 [2025-01-09 06:04:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:12,166 INFO L225 Difference]: With dead ends: 1048 [2025-01-09 06:04:12,166 INFO L226 Difference]: Without dead ends: 776 [2025-01-09 06:04:12,167 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:04:12,169 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 610 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:12,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 494 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-01-09 06:04:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 772. [2025-01-09 06:04:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 614 states have (on average 1.3957654723127035) internal successors, (857), 630 states have internal predecessors, (857), 91 states have call successors, (91), 50 states have call predecessors, (91), 65 states have return successors, (128), 98 states have call predecessors, (128), 87 states have call successors, (128) [2025-01-09 06:04:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1076 transitions. [2025-01-09 06:04:12,256 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1076 transitions. Word has length 62 [2025-01-09 06:04:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:12,257 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1076 transitions. [2025-01-09 06:04:12,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:04:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1076 transitions. [2025-01-09 06:04:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:04:12,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:12,261 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:04:12,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:04:12,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 970564300, now seen corresponding path program 1 times [2025-01-09 06:04:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318159118] [2025-01-09 06:04:12,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:12,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:04:12,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:04:12,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:12,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:12,328 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:04:12,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:12,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318159118] [2025-01-09 06:04:12,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318159118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:12,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727789996] [2025-01-09 06:04:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:12,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:12,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:12,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:12,331 INFO L87 Difference]: Start difference. First operand 772 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:04:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:12,472 INFO L93 Difference]: Finished difference Result 1793 states and 2443 transitions. [2025-01-09 06:04:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:12,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 63 [2025-01-09 06:04:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:12,484 INFO L225 Difference]: With dead ends: 1793 [2025-01-09 06:04:12,485 INFO L226 Difference]: Without dead ends: 1231 [2025-01-09 06:04:12,487 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:04:12,490 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 101 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:12,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 852 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-01-09 06:04:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1208. [2025-01-09 06:04:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 952 states have (on average 1.3644957983193278) internal successors, (1299), 971 states have internal predecessors, (1299), 134 states have call successors, (134), 92 states have call predecessors, (134), 120 states have return successors, (196), 151 states have call predecessors, (196), 130 states have call successors, (196) [2025-01-09 06:04:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1629 transitions. [2025-01-09 06:04:12,606 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1629 transitions. Word has length 63 [2025-01-09 06:04:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:12,607 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1629 transitions. [2025-01-09 06:04:12,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:04:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1629 transitions. [2025-01-09 06:04:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:04:12,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:12,612 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:04:12,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:04:12,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:12,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1420863458, now seen corresponding path program 1 times [2025-01-09 06:04:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:12,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749022963] [2025-01-09 06:04:12,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:12,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:04:12,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:04:12,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:12,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:12,673 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:04:12,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749022963] [2025-01-09 06:04:12,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749022963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:12,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:12,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:12,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976344096] [2025-01-09 06:04:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:12,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:12,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:12,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:12,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:12,677 INFO L87 Difference]: Start difference. First operand 1208 states and 1629 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:04:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:12,862 INFO L93 Difference]: Finished difference Result 3060 states and 4072 transitions. [2025-01-09 06:04:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:12,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 64 [2025-01-09 06:04:12,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:12,880 INFO L225 Difference]: With dead ends: 3060 [2025-01-09 06:04:12,880 INFO L226 Difference]: Without dead ends: 2082 [2025-01-09 06:04:12,885 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:04:12,886 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 416 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:12,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 547 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2025-01-09 06:04:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2048. [2025-01-09 06:04:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1592 states have (on average 1.321608040201005) internal successors, (2104), 1625 states have internal predecessors, (2104), 232 states have call successors, (232), 176 states have call predecessors, (232), 222 states have return successors, (340), 253 states have call predecessors, (340), 228 states have call successors, (340) [2025-01-09 06:04:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2676 transitions. [2025-01-09 06:04:13,112 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2676 transitions. Word has length 64 [2025-01-09 06:04:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:13,113 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 2676 transitions. [2025-01-09 06:04:13,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:04:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2676 transitions. [2025-01-09 06:04:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:04:13,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:13,116 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] [2025-01-09 06:04:13,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:04:13,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:13,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash -457343057, now seen corresponding path program 1 times [2025-01-09 06:04:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244521958] [2025-01-09 06:04:13,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:13,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:13,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:04:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:04:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244521958] [2025-01-09 06:04:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244521958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:13,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:13,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017268169] [2025-01-09 06:04:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:13,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:13,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:13,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:13,253 INFO L87 Difference]: Start difference. First operand 2048 states and 2676 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:13,638 INFO L93 Difference]: Finished difference Result 2813 states and 3630 transitions. [2025-01-09 06:04:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:04:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-01-09 06:04:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:13,657 INFO L225 Difference]: With dead ends: 2813 [2025-01-09 06:04:13,657 INFO L226 Difference]: Without dead ends: 2810 [2025-01-09 06:04:13,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:04:13,660 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 828 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:13,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 534 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:04:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2025-01-09 06:04:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2773. [2025-01-09 06:04:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2144 states have (on average 1.3055037313432836) internal successors, (2799), 2187 states have internal predecessors, (2799), 313 states have call successors, (313), 246 states have call predecessors, (313), 314 states have return successors, (463), 346 states have call predecessors, (463), 310 states have call successors, (463) [2025-01-09 06:04:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 3575 transitions. [2025-01-09 06:04:13,983 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 3575 transitions. Word has length 68 [2025-01-09 06:04:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:13,983 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 3575 transitions. [2025-01-09 06:04:13,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3575 transitions. [2025-01-09 06:04:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:04:13,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:13,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:13,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:04:13,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:13,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1293640497, now seen corresponding path program 1 times [2025-01-09 06:04:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:13,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585038987] [2025-01-09 06:04:13,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:13,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:04:14,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:04:14,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:14,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:14,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:14,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585038987] [2025-01-09 06:04:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585038987] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:04:14,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245523422] [2025-01-09 06:04:14,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:04:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:04:14,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:04:14,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 06:04:14,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:04:14,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:04:14,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:14,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:14,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:04:14,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:04:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:14,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:04:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:14,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245523422] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:04:14,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:04:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 06:04:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411574505] [2025-01-09 06:04:14,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:04:14,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:14,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:14,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:14,670 INFO L87 Difference]: Start difference. First operand 2773 states and 3575 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:04:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:15,452 INFO L93 Difference]: Finished difference Result 6416 states and 8222 transitions. [2025-01-09 06:04:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:04:15,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-01-09 06:04:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:15,499 INFO L225 Difference]: With dead ends: 6416 [2025-01-09 06:04:15,500 INFO L226 Difference]: Without dead ends: 6413 [2025-01-09 06:04:15,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:15,505 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 1159 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:15,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 1807 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2025-01-09 06:04:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 4456. [2025-01-09 06:04:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4456 states, 3447 states have (on average 1.2996808819263128) internal successors, (4480), 3514 states have internal predecessors, (4480), 493 states have call successors, (493), 400 states have call predecessors, (493), 514 states have return successors, (741), 548 states have call predecessors, (741), 490 states have call successors, (741) [2025-01-09 06:04:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5714 transitions. [2025-01-09 06:04:16,037 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5714 transitions. Word has length 69 [2025-01-09 06:04:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:16,038 INFO L471 AbstractCegarLoop]: Abstraction has 4456 states and 5714 transitions. [2025-01-09 06:04:16,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:04:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5714 transitions. [2025-01-09 06:04:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:04:16,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:16,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:16,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 06:04:16,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 06:04:16,246 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:16,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:16,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2053868435, now seen corresponding path program 2 times [2025-01-09 06:04:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994210440] [2025-01-09 06:04:16,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:04:16,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:16,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 06:04:16,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:04:16,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:04:16,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:16,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994210440] [2025-01-09 06:04:16,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994210440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:16,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:16,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641972601] [2025-01-09 06:04:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:16,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:16,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:16,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:16,301 INFO L87 Difference]: Start difference. First operand 4456 states and 5714 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:16,576 INFO L93 Difference]: Finished difference Result 6766 states and 8694 transitions. [2025-01-09 06:04:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-01-09 06:04:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:16,601 INFO L225 Difference]: With dead ends: 6766 [2025-01-09 06:04:16,601 INFO L226 Difference]: Without dead ends: 2953 [2025-01-09 06:04:16,613 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:04:16,615 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 415 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:16,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 644 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2025-01-09 06:04:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2933. [2025-01-09 06:04:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2272 states have (on average 1.2838908450704225) internal successors, (2917), 2317 states have internal predecessors, (2917), 329 states have call successors, (329), 260 states have call predecessors, (329), 330 states have return successors, (471), 362 states have call predecessors, (471), 326 states have call successors, (471) [2025-01-09 06:04:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 3717 transitions. [2025-01-09 06:04:16,880 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 3717 transitions. Word has length 71 [2025-01-09 06:04:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:16,880 INFO L471 AbstractCegarLoop]: Abstraction has 2933 states and 3717 transitions. [2025-01-09 06:04:16,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 3717 transitions. [2025-01-09 06:04:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 06:04:16,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:16,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:16,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:04:16,884 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:16,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash 374245907, now seen corresponding path program 1 times [2025-01-09 06:04:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:16,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096703236] [2025-01-09 06:04:16,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:16,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 06:04:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 06:04:16,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:16,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 06:04:16,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096703236] [2025-01-09 06:04:16,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096703236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:16,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:16,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:16,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335121305] [2025-01-09 06:04:16,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:16,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:17,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:17,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:17,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:17,001 INFO L87 Difference]: Start difference. First operand 2933 states and 3717 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:18,267 INFO L93 Difference]: Finished difference Result 8625 states and 10788 transitions. [2025-01-09 06:04:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 06:04:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-01-09 06:04:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:18,295 INFO L225 Difference]: With dead ends: 8625 [2025-01-09 06:04:18,295 INFO L226 Difference]: Without dead ends: 4620 [2025-01-09 06:04:18,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:04:18,306 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 624 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:18,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1322 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:04:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2025-01-09 06:04:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 4368. [2025-01-09 06:04:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4368 states, 3365 states have (on average 1.2567607726597325) internal successors, (4229), 3443 states have internal predecessors, (4229), 485 states have call successors, (485), 395 states have call predecessors, (485), 516 states have return successors, (746), 536 states have call predecessors, (746), 482 states have call successors, (746) [2025-01-09 06:04:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 5460 transitions. [2025-01-09 06:04:18,782 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 5460 transitions. Word has length 80 [2025-01-09 06:04:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:18,783 INFO L471 AbstractCegarLoop]: Abstraction has 4368 states and 5460 transitions. [2025-01-09 06:04:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 5460 transitions. [2025-01-09 06:04:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 06:04:18,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:18,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:18,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:04:18,788 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:18,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2008702643, now seen corresponding path program 1 times [2025-01-09 06:04:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:18,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511968724] [2025-01-09 06:04:18,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:18,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 06:04:18,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 06:04:18,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:18,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 06:04:18,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:18,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511968724] [2025-01-09 06:04:18,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511968724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:18,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:18,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:04:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450170477] [2025-01-09 06:04:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:18,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:18,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:18,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:18,908 INFO L87 Difference]: Start difference. First operand 4368 states and 5460 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:20,121 INFO L93 Difference]: Finished difference Result 7954 states and 9870 transitions. [2025-01-09 06:04:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:04:20,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-01-09 06:04:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:20,149 INFO L225 Difference]: With dead ends: 7954 [2025-01-09 06:04:20,149 INFO L226 Difference]: Without dead ends: 4025 [2025-01-09 06:04:20,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 06:04:20,161 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1308 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:20,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1398 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:04:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2025-01-09 06:04:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3731. [2025-01-09 06:04:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 2887 states have (on average 1.2469691721510219) internal successors, (3600), 2947 states have internal predecessors, (3600), 413 states have call successors, (413), 332 states have call predecessors, (413), 429 states have return successors, (573), 458 states have call predecessors, (573), 410 states have call successors, (573) [2025-01-09 06:04:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4586 transitions. [2025-01-09 06:04:20,507 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4586 transitions. Word has length 86 [2025-01-09 06:04:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:20,507 INFO L471 AbstractCegarLoop]: Abstraction has 3731 states and 4586 transitions. [2025-01-09 06:04:20,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4586 transitions. [2025-01-09 06:04:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:20,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:20,512 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] [2025-01-09 06:04:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:04:20,513 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:20,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash -590940231, now seen corresponding path program 1 times [2025-01-09 06:04:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518321659] [2025-01-09 06:04:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:20,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:20,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:20,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:20,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:20,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:20,562 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:04:20,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:20,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518321659] [2025-01-09 06:04:20,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518321659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:20,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:20,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050245764] [2025-01-09 06:04:20,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:20,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:20,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:20,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:20,565 INFO L87 Difference]: Start difference. First operand 3731 states and 4586 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:04:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:20,814 INFO L93 Difference]: Finished difference Result 3932 states and 4896 transitions. [2025-01-09 06:04:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:20,840 INFO L225 Difference]: With dead ends: 3932 [2025-01-09 06:04:20,841 INFO L226 Difference]: Without dead ends: 3731 [2025-01-09 06:04:20,844 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:04:20,844 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 312 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 566 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:04:20,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 566 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2025-01-09 06:04:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 3731. [2025-01-09 06:04:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 2887 states have (on average 1.2466227918254242) internal successors, (3599), 2947 states have internal predecessors, (3599), 413 states have call successors, (413), 332 states have call predecessors, (413), 429 states have return successors, (573), 458 states have call predecessors, (573), 410 states have call successors, (573) [2025-01-09 06:04:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4585 transitions. [2025-01-09 06:04:21,143 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4585 transitions. Word has length 100 [2025-01-09 06:04:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:21,144 INFO L471 AbstractCegarLoop]: Abstraction has 3731 states and 4585 transitions. [2025-01-09 06:04:21,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:04:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4585 transitions. [2025-01-09 06:04:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:21,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:21,150 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] [2025-01-09 06:04:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:04:21,150 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash -562439941, now seen corresponding path program 1 times [2025-01-09 06:04:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171348048] [2025-01-09 06:04:21,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:21,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:21,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:21,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:21,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:21,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:04:21,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:21,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171348048] [2025-01-09 06:04:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171348048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:21,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:21,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207723447] [2025-01-09 06:04:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:21,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:21,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:21,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:21,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:21,257 INFO L87 Difference]: Start difference. First operand 3731 states and 4585 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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:04:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:22,132 INFO L93 Difference]: Finished difference Result 4139 states and 5221 transitions. [2025-01-09 06:04:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:22,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:22,153 INFO L225 Difference]: With dead ends: 4139 [2025-01-09 06:04:22,154 INFO L226 Difference]: Without dead ends: 3945 [2025-01-09 06:04:22,157 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:04:22,158 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 729 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:22,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1086 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-01-09 06:04:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3928. [2025-01-09 06:04:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3063 states have (on average 1.2654260528893242) internal successors, (3876), 3124 states have internal predecessors, (3876), 427 states have call successors, (427), 338 states have call predecessors, (427), 436 states have return successors, (588), 472 states have call predecessors, (588), 424 states have call successors, (588) [2025-01-09 06:04:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 4891 transitions. [2025-01-09 06:04:22,503 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 4891 transitions. Word has length 100 [2025-01-09 06:04:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:22,504 INFO L471 AbstractCegarLoop]: Abstraction has 3928 states and 4891 transitions. [2025-01-09 06:04:22,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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:04:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 4891 transitions. [2025-01-09 06:04:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:22,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:22,511 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] [2025-01-09 06:04:22,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:04:22,511 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:22,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:22,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1876028663, now seen corresponding path program 1 times [2025-01-09 06:04:22,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:22,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806303074] [2025-01-09 06:04:22,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:22,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:22,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:22,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:22,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:22,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:22,648 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:04:22,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:22,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806303074] [2025-01-09 06:04:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806303074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:22,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835556504] [2025-01-09 06:04:22,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:22,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:22,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:22,650 INFO L87 Difference]: Start difference. First operand 3928 states and 4891 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:23,571 INFO L93 Difference]: Finished difference Result 4563 states and 5884 transitions. [2025-01-09 06:04:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:23,606 INFO L225 Difference]: With dead ends: 4563 [2025-01-09 06:04:23,606 INFO L226 Difference]: Without dead ends: 4172 [2025-01-09 06:04:23,610 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:04:23,611 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 721 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:23,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1827 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2025-01-09 06:04:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 4111. [2025-01-09 06:04:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 3225 states have (on average 1.2790697674418605) internal successors, (4125), 3287 states have internal predecessors, (4125), 441 states have call successors, (441), 344 states have call predecessors, (441), 443 states have return successors, (605), 487 states have call predecessors, (605), 438 states have call successors, (605) [2025-01-09 06:04:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 5171 transitions. [2025-01-09 06:04:23,988 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 5171 transitions. Word has length 100 [2025-01-09 06:04:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 4111 states and 5171 transitions. [2025-01-09 06:04:23,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 5171 transitions. [2025-01-09 06:04:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:23,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:23,994 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] [2025-01-09 06:04:23,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:04:23,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:23,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash -852180683, now seen corresponding path program 1 times [2025-01-09 06:04:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802802525] [2025-01-09 06:04:23,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:23,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:24,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:24,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:24,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:24,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:24,119 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:04:24,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:24,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802802525] [2025-01-09 06:04:24,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802802525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:24,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346791992] [2025-01-09 06:04:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:24,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:24,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:24,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:24,121 INFO L87 Difference]: Start difference. First operand 4111 states and 5171 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:25,109 INFO L93 Difference]: Finished difference Result 5137 states and 6773 transitions. [2025-01-09 06:04:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:25,132 INFO L225 Difference]: With dead ends: 5137 [2025-01-09 06:04:25,132 INFO L226 Difference]: Without dead ends: 4563 [2025-01-09 06:04:25,136 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:04:25,138 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 716 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:25,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1811 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2025-01-09 06:04:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 4496. [2025-01-09 06:04:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 3566 states have (on average 1.3051037577117217) internal successors, (4654), 3632 states have internal predecessors, (4654), 469 states have call successors, (469), 356 states have call predecessors, (469), 459 states have return successors, (645), 517 states have call predecessors, (645), 466 states have call successors, (645) [2025-01-09 06:04:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 5768 transitions. [2025-01-09 06:04:25,595 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 5768 transitions. Word has length 100 [2025-01-09 06:04:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:25,595 INFO L471 AbstractCegarLoop]: Abstraction has 4496 states and 5768 transitions. [2025-01-09 06:04:25,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 5768 transitions. [2025-01-09 06:04:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:25,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:25,601 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] [2025-01-09 06:04:25,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:04:25,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:25,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1910018761, now seen corresponding path program 1 times [2025-01-09 06:04:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800760254] [2025-01-09 06:04:25,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:25,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:25,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:25,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:25,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:25,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:25,730 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:04:25,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800760254] [2025-01-09 06:04:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800760254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:25,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:25,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397965994] [2025-01-09 06:04:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:25,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:25,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:25,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:25,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:25,732 INFO L87 Difference]: Start difference. First operand 4496 states and 5768 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:26,814 INFO L93 Difference]: Finished difference Result 6356 states and 8696 transitions. [2025-01-09 06:04:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:26,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:26,837 INFO L225 Difference]: With dead ends: 6356 [2025-01-09 06:04:26,837 INFO L226 Difference]: Without dead ends: 5397 [2025-01-09 06:04:26,843 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:04:26,844 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 732 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:26,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1322 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2025-01-09 06:04:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 5317. [2025-01-09 06:04:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 4293 states have (on average 1.3496389471232237) internal successors, (5794), 4373 states have internal predecessors, (5794), 525 states have call successors, (525), 380 states have call predecessors, (525), 497 states have return successors, (749), 577 states have call predecessors, (749), 522 states have call successors, (749) [2025-01-09 06:04:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 7068 transitions. [2025-01-09 06:04:27,296 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 7068 transitions. Word has length 100 [2025-01-09 06:04:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:27,296 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 7068 transitions. [2025-01-09 06:04:27,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 7068 transitions. [2025-01-09 06:04:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:27,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:27,302 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] [2025-01-09 06:04:27,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:04:27,302 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:27,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1242446069, now seen corresponding path program 1 times [2025-01-09 06:04:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333559727] [2025-01-09 06:04:27,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:27,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:27,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:27,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:27,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:27,423 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:04:27,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333559727] [2025-01-09 06:04:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333559727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:27,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:27,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:27,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058276181] [2025-01-09 06:04:27,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:27,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:27,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:27,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:27,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:27,424 INFO L87 Difference]: Start difference. First operand 5317 states and 7068 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:28,485 INFO L93 Difference]: Finished difference Result 8979 states and 12954 transitions. [2025-01-09 06:04:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:28,518 INFO L225 Difference]: With dead ends: 8979 [2025-01-09 06:04:28,518 INFO L226 Difference]: Without dead ends: 7199 [2025-01-09 06:04:28,528 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:04:28,528 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 706 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:28,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1787 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2025-01-09 06:04:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 7094. [2025-01-09 06:04:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7094 states, 5864 states have (on average 1.4130286493860846) internal successors, (8286), 5990 states have internal predecessors, (8286), 637 states have call successors, (637), 428 states have call predecessors, (637), 591 states have return successors, (1053), 697 states have call predecessors, (1053), 634 states have call successors, (1053) [2025-01-09 06:04:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7094 states to 7094 states and 9976 transitions. [2025-01-09 06:04:29,087 INFO L78 Accepts]: Start accepts. Automaton has 7094 states and 9976 transitions. Word has length 100 [2025-01-09 06:04:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:29,087 INFO L471 AbstractCegarLoop]: Abstraction has 7094 states and 9976 transitions. [2025-01-09 06:04:29,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7094 states and 9976 transitions. [2025-01-09 06:04:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:29,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:29,094 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] [2025-01-09 06:04:29,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:04:29,095 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:29,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1482685815, now seen corresponding path program 1 times [2025-01-09 06:04:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:29,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903569645] [2025-01-09 06:04:29,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:29,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:29,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:29,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:29,177 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:04:29,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:29,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903569645] [2025-01-09 06:04:29,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903569645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:29,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:29,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:29,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035311630] [2025-01-09 06:04:29,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:29,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:29,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:29,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:29,180 INFO L87 Difference]: Start difference. First operand 7094 states and 9976 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:04:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:30,250 INFO L93 Difference]: Finished difference Result 11232 states and 16869 transitions. [2025-01-09 06:04:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:04:30,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:30,289 INFO L225 Difference]: With dead ends: 11232 [2025-01-09 06:04:30,289 INFO L226 Difference]: Without dead ends: 7675 [2025-01-09 06:04:30,303 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:04:30,304 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 565 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:30,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 742 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7675 states. [2025-01-09 06:04:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7675 to 7094. [2025-01-09 06:04:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7094 states, 5864 states have (on average 1.4101296043656206) internal successors, (8269), 5990 states have internal predecessors, (8269), 637 states have call successors, (637), 428 states have call predecessors, (637), 591 states have return successors, (1053), 697 states have call predecessors, (1053), 634 states have call successors, (1053) [2025-01-09 06:04:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7094 states to 7094 states and 9959 transitions. [2025-01-09 06:04:30,996 INFO L78 Accepts]: Start accepts. Automaton has 7094 states and 9959 transitions. Word has length 100 [2025-01-09 06:04:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:30,997 INFO L471 AbstractCegarLoop]: Abstraction has 7094 states and 9959 transitions. [2025-01-09 06:04:30,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:04:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7094 states and 9959 transitions. [2025-01-09 06:04:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:31,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:31,007 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] [2025-01-09 06:04:31,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:04:31,009 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1973247819, now seen corresponding path program 1 times [2025-01-09 06:04:31,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:31,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426263867] [2025-01-09 06:04:31,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:31,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:31,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:31,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:31,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:31,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:31,127 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:04:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:31,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426263867] [2025-01-09 06:04:31,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426263867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:31,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:31,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441696953] [2025-01-09 06:04:31,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:31,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:31,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:31,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:31,129 INFO L87 Difference]: Start difference. First operand 7094 states and 9959 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:32,668 INFO L93 Difference]: Finished difference Result 15118 states and 23218 transitions. [2025-01-09 06:04:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:32,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:32,723 INFO L225 Difference]: With dead ends: 15118 [2025-01-09 06:04:32,724 INFO L226 Difference]: Without dead ends: 11561 [2025-01-09 06:04:32,737 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:04:32,739 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 826 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:32,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1739 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:04:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11561 states. [2025-01-09 06:04:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11561 to 10726. [2025-01-09 06:04:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10726 states, 9046 states have (on average 1.4705947380057485) internal successors, (13303), 9318 states have internal predecessors, (13303), 845 states have call successors, (845), 524 states have call predecessors, (845), 833 states have return successors, (2029), 921 states have call predecessors, (2029), 842 states have call successors, (2029) [2025-01-09 06:04:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10726 states to 10726 states and 16177 transitions. [2025-01-09 06:04:33,662 INFO L78 Accepts]: Start accepts. Automaton has 10726 states and 16177 transitions. Word has length 100 [2025-01-09 06:04:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:33,663 INFO L471 AbstractCegarLoop]: Abstraction has 10726 states and 16177 transitions. [2025-01-09 06:04:33,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 10726 states and 16177 transitions. [2025-01-09 06:04:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:33,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:33,673 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] [2025-01-09 06:04:33,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:04:33,673 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:33,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1946182217, now seen corresponding path program 1 times [2025-01-09 06:04:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025742116] [2025-01-09 06:04:33,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:33,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:33,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:33,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:33,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:33,766 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:04:33,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:33,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025742116] [2025-01-09 06:04:33,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025742116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:33,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:33,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:33,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803100299] [2025-01-09 06:04:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:33,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:33,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:33,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:33,769 INFO L87 Difference]: Start difference. First operand 10726 states and 16177 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:36,174 INFO L93 Difference]: Finished difference Result 27124 states and 44966 transitions. [2025-01-09 06:04:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:36,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:36,290 INFO L225 Difference]: With dead ends: 27124 [2025-01-09 06:04:36,290 INFO L226 Difference]: Without dead ends: 19935 [2025-01-09 06:04:36,325 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:04:36,328 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 721 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:36,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1731 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:04:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19935 states. [2025-01-09 06:04:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19935 to 18815. [2025-01-09 06:04:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18815 states, 16089 states have (on average 1.5269438746969979) internal successors, (24567), 16815 states have internal predecessors, (24567), 1245 states have call successors, (1245), 716 states have call predecessors, (1245), 1479 states have return successors, (5501), 1353 states have call predecessors, (5501), 1242 states have call successors, (5501) [2025-01-09 06:04:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18815 states to 18815 states and 31313 transitions. [2025-01-09 06:04:37,738 INFO L78 Accepts]: Start accepts. Automaton has 18815 states and 31313 transitions. Word has length 100 [2025-01-09 06:04:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:37,738 INFO L471 AbstractCegarLoop]: Abstraction has 18815 states and 31313 transitions. [2025-01-09 06:04:37,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 18815 states and 31313 transitions. [2025-01-09 06:04:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:37,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:37,750 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] [2025-01-09 06:04:37,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:04:37,751 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash 271448181, now seen corresponding path program 1 times [2025-01-09 06:04:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833194743] [2025-01-09 06:04:37,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:37,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:37,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:37,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:37,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:37,855 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:04:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833194743] [2025-01-09 06:04:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833194743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:37,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871224382] [2025-01-09 06:04:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:37,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:37,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:37,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:37,858 INFO L87 Difference]: Start difference. First operand 18815 states and 31313 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:40,443 INFO L93 Difference]: Finished difference Result 52325 states and 96976 transitions. [2025-01-09 06:04:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:40,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:40,668 INFO L225 Difference]: With dead ends: 52325 [2025-01-09 06:04:40,669 INFO L226 Difference]: Without dead ends: 37047 [2025-01-09 06:04:40,734 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:04:40,734 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 724 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:40,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1705 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2025-01-09 06:04:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 35869. [2025-01-09 06:04:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35869 states, 30597 states have (on average 1.5519495375363597) internal successors, (47485), 32717 states have internal predecessors, (47485), 2013 states have call successors, (2013), 1100 states have call predecessors, (2013), 3257 states have return successors, (18557), 2185 states have call predecessors, (18557), 2010 states have call successors, (18557) [2025-01-09 06:04:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35869 states to 35869 states and 68055 transitions. [2025-01-09 06:04:44,919 INFO L78 Accepts]: Start accepts. Automaton has 35869 states and 68055 transitions. Word has length 100 [2025-01-09 06:04:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:44,920 INFO L471 AbstractCegarLoop]: Abstraction has 35869 states and 68055 transitions. [2025-01-09 06:04:44,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 35869 states and 68055 transitions. [2025-01-09 06:04:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:44,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:44,940 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] [2025-01-09 06:04:44,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:04:44,940 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:44,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1158671027, now seen corresponding path program 1 times [2025-01-09 06:04:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:44,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180921194] [2025-01-09 06:04:44,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:44,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:44,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:44,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:44,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:44,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:45,040 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:04:45,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180921194] [2025-01-09 06:04:45,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180921194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:45,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:45,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:45,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358196108] [2025-01-09 06:04:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:45,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:45,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:45,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:45,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:45,043 INFO L87 Difference]: Start difference. First operand 35869 states and 68055 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:51,001 INFO L93 Difference]: Finished difference Result 105607 states and 231708 transitions. [2025-01-09 06:04:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:51,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:04:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:51,625 INFO L225 Difference]: With dead ends: 105607 [2025-01-09 06:04:51,625 INFO L226 Difference]: Without dead ends: 73275 [2025-01-09 06:04:51,777 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:04:51,778 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 678 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:51,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1693 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:04:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73275 states. [2025-01-09 06:04:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73275 to 71972. [2025-01-09 06:04:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71972 states, 60214 states have (on average 1.5466336732321386) internal successors, (93129), 66580 states have internal predecessors, (93129), 3485 states have call successors, (3485), 1868 states have call predecessors, (3485), 8271 states have return successors, (69181), 3785 states have call predecessors, (69181), 3482 states have call successors, (69181) [2025-01-09 06:04:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71972 states to 71972 states and 165795 transitions. [2025-01-09 06:04:59,303 INFO L78 Accepts]: Start accepts. Automaton has 71972 states and 165795 transitions. Word has length 100 [2025-01-09 06:04:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:59,303 INFO L471 AbstractCegarLoop]: Abstraction has 71972 states and 165795 transitions. [2025-01-09 06:04:59,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:04:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 71972 states and 165795 transitions. [2025-01-09 06:04:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:04:59,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:59,345 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] [2025-01-09 06:04:59,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:04:59,345 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:59,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -752371531, now seen corresponding path program 1 times [2025-01-09 06:04:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959719748] [2025-01-09 06:04:59,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:59,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:04:59,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:04:59,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:59,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:59,419 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:04:59,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959719748] [2025-01-09 06:04:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959719748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920915634] [2025-01-09 06:04:59,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:59,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:59,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:59,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:59,421 INFO L87 Difference]: Start difference. First operand 71972 states and 165795 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)