./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.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.06.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 0becd5109c9f10d4cd495bd258560ff3ae7f6a1dd143c8dd06621d725fa7a35e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:04:27,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:04:27,049 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:27,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:04:27,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:04:27,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:04:27,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:04:27,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:04:27,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:04:27,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:04:27,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:04:27,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:04:27,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:04:27,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:04:27,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:04:27,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:27,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:04:27,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:27,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:04:27,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:04:27,089 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 -> 0becd5109c9f10d4cd495bd258560ff3ae7f6a1dd143c8dd06621d725fa7a35e [2025-01-09 06:04:27,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:04:27,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:04:27,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:04:27,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:04:27,374 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:04:27,377 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.06.cil-2.c [2025-01-09 06:04:28,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a6fdd436/59230394a4544bbe8bc05c087f11800e/FLAGe8ee12d75 [2025-01-09 06:04:29,043 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:04:29,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2025-01-09 06:04:29,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a6fdd436/59230394a4544bbe8bc05c087f11800e/FLAGe8ee12d75 [2025-01-09 06:04:29,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a6fdd436/59230394a4544bbe8bc05c087f11800e [2025-01-09 06:04:29,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:04:29,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:04:29,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:04:29,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:04:29,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:04:29,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:04:29" (1/1) ... [2025-01-09 06:04:29,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5c9212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:29, skipping insertion in model container [2025-01-09 06:04:29,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:04:29" (1/1) ... [2025-01-09 06:04:29,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:04:29,410 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.06.cil-2.c[914,927] [2025-01-09 06:04:29,447 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.06.cil-2.c[7115,7128] [2025-01-09 06:04:29,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:04:29,508 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:04:29,523 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.06.cil-2.c[914,927] [2025-01-09 06:04:29,537 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.06.cil-2.c[7115,7128] [2025-01-09 06:04:29,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:04:29,575 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:04:29,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:29 WrapperNode [2025-01-09 06:04:29,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:04:29,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:04:29,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:04:29,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:04:29,583 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:29" (1/1) ... [2025-01-09 06:04:29,595 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:29" (1/1) ... [2025-01-09 06:04:29,632 INFO L138 Inliner]: procedures = 65, calls = 75, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 669 [2025-01-09 06:04:29,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:04:29,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:04:29,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:04:29,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:04:29,639 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:29" (1/1) ... [2025-01-09 06:04:29,639 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:29" (1/1) ... [2025-01-09 06:04:29,643 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:29" (1/1) ... [2025-01-09 06:04:29,671 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:29,671 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:29" (1/1) ... [2025-01-09 06:04:29,671 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:29" (1/1) ... [2025-01-09 06:04:29,681 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:29" (1/1) ... [2025-01-09 06:04:29,686 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:29" (1/1) ... [2025-01-09 06:04:29,698 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:29" (1/1) ... [2025-01-09 06:04:29,700 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:29" (1/1) ... [2025-01-09 06:04:29,703 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:29" (1/1) ... [2025-01-09 06:04:29,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:04:29,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:04:29,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:04:29,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:04:29,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:29" (1/1) ... [2025-01-09 06:04:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:29,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:04:29,741 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:29,750 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:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:04:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:04:29,768 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:04:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:04:29,768 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:04:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:04:29,768 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:04:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:04:29,768 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:04:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:04:29,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:04:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:04:29,769 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:04:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:04:29,769 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:04:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:04:29,769 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:04:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:04:29,770 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:04:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:04:29,770 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:04:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:04:29,770 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:04:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:04:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:04:29,770 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:04:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:04:29,771 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:04:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:04:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:04:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:04:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:04:29,860 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:04:29,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:04:30,442 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-01-09 06:04:30,442 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:04:30,458 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:04:30,458 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 06:04:30,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:04:30 BoogieIcfgContainer [2025-01-09 06:04:30,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:04:30,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:04:30,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:04:30,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:04:30,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:04:29" (1/3) ... [2025-01-09 06:04:30,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668e0e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:04:30, skipping insertion in model container [2025-01-09 06:04:30,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:29" (2/3) ... [2025-01-09 06:04:30,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668e0e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:04:30, skipping insertion in model container [2025-01-09 06:04:30,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:04:30" (3/3) ... [2025-01-09 06:04:30,465 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2025-01-09 06:04:30,474 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:04:30,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.06.cil-2.c that has 15 procedures, 327 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 06:04:30,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:04:30,548 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;@26931071, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:04:30,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:04:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 327 states, 278 states have (on average 1.5611510791366907) internal successors, (434), 282 states have internal predecessors, (434), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 06:04:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:30,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:30,559 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:30,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:30,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 794682294, now seen corresponding path program 1 times [2025-01-09 06:04:30,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:30,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098781090] [2025-01-09 06:04:30,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:30,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:30,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:30,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:30,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:30,899 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:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:30,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098781090] [2025-01-09 06:04:30,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098781090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:30,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:30,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300258585] [2025-01-09 06:04:30,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:30,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:30,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:30,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:30,930 INFO L87 Difference]: Start difference. First operand has 327 states, 278 states have (on average 1.5611510791366907) internal successors, (434), 282 states have internal predecessors, (434), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) 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:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:31,483 INFO L93 Difference]: Finished difference Result 731 states and 1120 transitions. [2025-01-09 06:04:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:31,485 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:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:31,493 INFO L225 Difference]: With dead ends: 731 [2025-01-09 06:04:31,493 INFO L226 Difference]: Without dead ends: 416 [2025-01-09 06:04:31,497 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:31,498 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 356 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:31,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1076 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-09 06:04:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 409. [2025-01-09 06:04:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 340 states have (on average 1.5) internal successors, (510), 346 states have internal predecessors, (510), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2025-01-09 06:04:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 603 transitions. [2025-01-09 06:04:31,553 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 603 transitions. Word has length 62 [2025-01-09 06:04:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:31,553 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 603 transitions. [2025-01-09 06:04:31,554 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:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 603 transitions. [2025-01-09 06:04:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:31,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:31,556 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:31,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:04:31,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:31,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 293988857, now seen corresponding path program 1 times [2025-01-09 06:04:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:31,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071495713] [2025-01-09 06:04:31,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:31,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:31,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:31,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:31,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:31,715 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,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071495713] [2025-01-09 06:04:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071495713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:31,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671105491] [2025-01-09 06:04:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:31,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:31,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:31,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:31,718 INFO L87 Difference]: Start difference. First operand 409 states and 603 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:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:32,346 INFO L93 Difference]: Finished difference Result 714 states and 1022 transitions. [2025-01-09 06:04:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:32,346 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:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:32,353 INFO L225 Difference]: With dead ends: 714 [2025-01-09 06:04:32,353 INFO L226 Difference]: Without dead ends: 545 [2025-01-09 06:04:32,355 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:32,358 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 711 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:32,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1222 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-01-09 06:04:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 501. [2025-01-09 06:04:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 412 states have (on average 1.4805825242718447) internal successors, (610), 420 states have internal predecessors, (610), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2025-01-09 06:04:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 733 transitions. [2025-01-09 06:04:32,425 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 733 transitions. Word has length 62 [2025-01-09 06:04:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:32,426 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 733 transitions. [2025-01-09 06:04:32,426 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:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 733 transitions. [2025-01-09 06:04:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:32,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:32,431 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:32,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:04:32,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2061816393, now seen corresponding path program 1 times [2025-01-09 06:04:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544195858] [2025-01-09 06:04:32,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:32,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:32,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:32,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:32,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:32,523 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:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544195858] [2025-01-09 06:04:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544195858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913899183] [2025-01-09 06:04:32,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:32,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:32,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:32,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:32,526 INFO L87 Difference]: Start difference. First operand 501 states and 733 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:04:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:33,011 INFO L93 Difference]: Finished difference Result 2412 states and 3415 transitions. [2025-01-09 06:04:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:33,011 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), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-01-09 06:04:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:33,022 INFO L225 Difference]: With dead ends: 2412 [2025-01-09 06:04:33,022 INFO L226 Difference]: Without dead ends: 2157 [2025-01-09 06:04:33,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:04:33,024 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 1490 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:33,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1989 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2025-01-09 06:04:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2027. [2025-01-09 06:04:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 1601 states have (on average 1.3797626483447845) internal successors, (2209), 1637 states have internal predecessors, (2209), 221 states have call successors, (221), 172 states have call predecessors, (221), 203 states have return successors, (333), 221 states have call predecessors, (333), 219 states have call successors, (333) [2025-01-09 06:04:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2763 transitions. [2025-01-09 06:04:33,172 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2763 transitions. Word has length 62 [2025-01-09 06:04:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:33,172 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 2763 transitions. [2025-01-09 06:04:33,172 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), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:04:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2763 transitions. [2025-01-09 06:04:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:33,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:33,175 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:33,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:04:33,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:33,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1142841770, now seen corresponding path program 1 times [2025-01-09 06:04:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:33,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710039553] [2025-01-09 06:04:33,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:33,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:33,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:33,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:33,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:33,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:33,248 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,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:33,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710039553] [2025-01-09 06:04:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710039553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:33,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282524763] [2025-01-09 06:04:33,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:33,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:33,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:33,250 INFO L87 Difference]: Start difference. First operand 2027 states and 2763 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:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:33,391 INFO L93 Difference]: Finished difference Result 3853 states and 5256 transitions. [2025-01-09 06:04:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:33,392 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:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:33,401 INFO L225 Difference]: With dead ends: 3853 [2025-01-09 06:04:33,402 INFO L226 Difference]: Without dead ends: 2072 [2025-01-09 06:04:33,405 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:33,406 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 0 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2355 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:33,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2355 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:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2025-01-09 06:04:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2025-01-09 06:04:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1637 states have (on average 1.3622480146609652) internal successors, (2230), 1673 states have internal predecessors, (2230), 221 states have call successors, (221), 172 states have call predecessors, (221), 212 states have return successors, (351), 230 states have call predecessors, (351), 219 states have call successors, (351) [2025-01-09 06:04:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2802 transitions. [2025-01-09 06:04:33,520 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2802 transitions. Word has length 62 [2025-01-09 06:04:33,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:33,520 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 2802 transitions. [2025-01-09 06:04:33,520 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:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2802 transitions. [2025-01-09 06:04:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:33,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:33,522 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:33,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:04:33,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:33,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1080802156, now seen corresponding path program 1 times [2025-01-09 06:04:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474144852] [2025-01-09 06:04:33,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:33,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:33,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:33,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:33,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:33,666 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,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:33,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474144852] [2025-01-09 06:04:33,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474144852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:33,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:33,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553340381] [2025-01-09 06:04:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:33,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:33,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:33,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:33,668 INFO L87 Difference]: Start difference. First operand 2072 states and 2802 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:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:34,320 INFO L93 Difference]: Finished difference Result 3768 states and 5007 transitions. [2025-01-09 06:04:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:04:34,320 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:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:34,332 INFO L225 Difference]: With dead ends: 3768 [2025-01-09 06:04:34,333 INFO L226 Difference]: Without dead ends: 2289 [2025-01-09 06:04:34,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:04:34,337 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 705 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:34,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1023 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2025-01-09 06:04:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 2087. [2025-01-09 06:04:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 1653 states have (on average 1.355111917725348) internal successors, (2240), 1684 states have internal predecessors, (2240), 222 states have call successors, (222), 173 states have call predecessors, (222), 210 states have return successors, (336), 233 states have call predecessors, (336), 220 states have call successors, (336) [2025-01-09 06:04:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2798 transitions. [2025-01-09 06:04:34,487 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2798 transitions. Word has length 62 [2025-01-09 06:04:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:34,487 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 2798 transitions. [2025-01-09 06:04:34,487 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:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2798 transitions. [2025-01-09 06:04:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:34,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:34,489 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:34,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:04:34,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:34,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash -658100330, now seen corresponding path program 1 times [2025-01-09 06:04:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:34,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820439789] [2025-01-09 06:04:34,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:34,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:34,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:34,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:34,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:34,550 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:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820439789] [2025-01-09 06:04:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820439789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:34,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:34,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457868705] [2025-01-09 06:04:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:34,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:34,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:34,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:34,553 INFO L87 Difference]: Start difference. First operand 2087 states and 2798 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:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:35,103 INFO L93 Difference]: Finished difference Result 5811 states and 7778 transitions. [2025-01-09 06:04:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:04:35,104 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:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:35,124 INFO L225 Difference]: With dead ends: 5811 [2025-01-09 06:04:35,124 INFO L226 Difference]: Without dead ends: 3973 [2025-01-09 06:04:35,129 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:35,130 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 658 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:35,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 524 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2025-01-09 06:04:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3969. [2025-01-09 06:04:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3084 states have (on average 1.3060959792477302) internal successors, (4028), 3158 states have internal predecessors, (4028), 443 states have call successors, (443), 339 states have call predecessors, (443), 440 states have return successors, (801), 478 states have call predecessors, (801), 441 states have call successors, (801) [2025-01-09 06:04:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 5272 transitions. [2025-01-09 06:04:35,379 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 5272 transitions. Word has length 62 [2025-01-09 06:04:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:35,379 INFO L471 AbstractCegarLoop]: Abstraction has 3969 states and 5272 transitions. [2025-01-09 06:04:35,380 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:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 5272 transitions. [2025-01-09 06:04:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:04:35,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:35,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:35,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:04:35,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:35,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash -690169440, now seen corresponding path program 1 times [2025-01-09 06:04:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80710521] [2025-01-09 06:04:35,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:35,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:04:35,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:04:35,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:35,413 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:35,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80710521] [2025-01-09 06:04:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80710521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416930290] [2025-01-09 06:04:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:35,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:35,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:35,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:35,415 INFO L87 Difference]: Start difference. First operand 3969 states and 5272 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:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:35,675 INFO L93 Difference]: Finished difference Result 10097 states and 13474 transitions. [2025-01-09 06:04:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:35,675 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:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:35,715 INFO L225 Difference]: With dead ends: 10097 [2025-01-09 06:04:35,716 INFO L226 Difference]: Without dead ends: 6356 [2025-01-09 06:04:35,727 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:35,728 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 102 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:35,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 925 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6356 states. [2025-01-09 06:04:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6356 to 6222. [2025-01-09 06:04:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 4778 states have (on average 1.294474675596484) internal successors, (6185), 4875 states have internal predecessors, (6185), 716 states have call successors, (716), 571 states have call predecessors, (716), 726 states have return successors, (1308), 782 states have call predecessors, (1308), 714 states have call successors, (1308) [2025-01-09 06:04:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 8209 transitions. [2025-01-09 06:04:36,161 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 8209 transitions. Word has length 63 [2025-01-09 06:04:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:36,161 INFO L471 AbstractCegarLoop]: Abstraction has 6222 states and 8209 transitions. [2025-01-09 06:04:36,161 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:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 8209 transitions. [2025-01-09 06:04:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:04:36,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:36,164 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:36,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:04:36,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1860475938, now seen corresponding path program 1 times [2025-01-09 06:04:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:36,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17070248] [2025-01-09 06:04:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:36,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:04:36,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:04:36,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:36,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:36,221 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:36,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:36,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17070248] [2025-01-09 06:04:36,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17070248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:36,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:36,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128814821] [2025-01-09 06:04:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:36,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:36,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:36,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:36,223 INFO L87 Difference]: Start difference. First operand 6222 states and 8209 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:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:36,728 INFO L93 Difference]: Finished difference Result 7363 states and 9637 transitions. [2025-01-09 06:04:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:04:36,728 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:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:36,763 INFO L225 Difference]: With dead ends: 7363 [2025-01-09 06:04:36,763 INFO L226 Difference]: Without dead ends: 7360 [2025-01-09 06:04:36,767 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:36,768 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 882 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 570 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:36,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 570 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:04:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2025-01-09 06:04:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 7261. [2025-01-09 06:04:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7261 states, 5558 states have (on average 1.2857142857142858) internal successors, (7146), 5665 states have internal predecessors, (7146), 847 states have call successors, (847), 685 states have call predecessors, (847), 854 states have return successors, (1516), 917 states have call predecessors, (1516), 846 states have call successors, (1516) [2025-01-09 06:04:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 9509 transitions. [2025-01-09 06:04:37,171 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 9509 transitions. Word has length 68 [2025-01-09 06:04:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:37,172 INFO L471 AbstractCegarLoop]: Abstraction has 7261 states and 9509 transitions. [2025-01-09 06:04:37,172 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:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 9509 transitions. [2025-01-09 06:04:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:04:37,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:37,174 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:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:04:37,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:37,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1839230787, now seen corresponding path program 1 times [2025-01-09 06:04:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721912389] [2025-01-09 06:04:37,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:37,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:04:37,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:04:37,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:37,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:37,320 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:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721912389] [2025-01-09 06:04:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721912389] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:04:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046901982] [2025-01-09 06:04:37,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:37,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:04:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:04:37,331 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:37,334 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:37,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:04:37,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:04:37,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:37,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:37,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:04:37,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:04:37,693 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:37,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:04:37,767 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:37,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046901982] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:04:37,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:04:37,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 06:04:37,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507075718] [2025-01-09 06:04:37,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:04:37,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:37,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:37,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:37,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:37,769 INFO L87 Difference]: Start difference. First operand 7261 states and 9509 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:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:38,804 INFO L93 Difference]: Finished difference Result 15316 states and 19889 transitions. [2025-01-09 06:04:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:04:38,804 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:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:38,882 INFO L225 Difference]: With dead ends: 15316 [2025-01-09 06:04:38,882 INFO L226 Difference]: Without dead ends: 15313 [2025-01-09 06:04:38,891 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:38,893 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 847 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:38,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1965 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:04:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2025-01-09 06:04:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 13980. [2025-01-09 06:04:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13980 states, 10694 states have (on average 1.2800635870581634) internal successors, (13689), 10898 states have internal predecessors, (13689), 1613 states have call successors, (1613), 1319 states have call predecessors, (1613), 1671 states have return successors, (2925), 1769 states have call predecessors, (2925), 1612 states have call successors, (2925) [2025-01-09 06:04:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13980 states to 13980 states and 18227 transitions. [2025-01-09 06:04:39,789 INFO L78 Accepts]: Start accepts. Automaton has 13980 states and 18227 transitions. Word has length 69 [2025-01-09 06:04:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:39,790 INFO L471 AbstractCegarLoop]: Abstraction has 13980 states and 18227 transitions. [2025-01-09 06:04:39,790 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:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 13980 states and 18227 transitions. [2025-01-09 06:04:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:04:39,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:39,792 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:39,800 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:39,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:04:39,997 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2137945407, now seen corresponding path program 2 times [2025-01-09 06:04:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425565063] [2025-01-09 06:04:39,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:04:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:40,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 06:04:40,024 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:40,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:04:40,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:40,049 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:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425565063] [2025-01-09 06:04:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425565063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:40,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15465253] [2025-01-09 06:04:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:40,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:40,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:40,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:40,051 INFO L87 Difference]: Start difference. First operand 13980 states and 18227 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:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:40,455 INFO L93 Difference]: Finished difference Result 20859 states and 27262 transitions. [2025-01-09 06:04:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:40,455 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:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:40,496 INFO L225 Difference]: With dead ends: 20859 [2025-01-09 06:04:40,496 INFO L226 Difference]: Without dead ends: 7989 [2025-01-09 06:04:40,522 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:40,522 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 444 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 662 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:40,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 662 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:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7989 states. [2025-01-09 06:04:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7989 to 7891. [2025-01-09 06:04:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7891 states, 6060 states have (on average 1.2566006600660067) internal successors, (7615), 6161 states have internal predecessors, (7615), 916 states have call successors, (916), 741 states have call predecessors, (916), 913 states have return successors, (1530), 995 states have call predecessors, (1530), 915 states have call successors, (1530) [2025-01-09 06:04:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7891 states to 7891 states and 10061 transitions. [2025-01-09 06:04:40,936 INFO L78 Accepts]: Start accepts. Automaton has 7891 states and 10061 transitions. Word has length 71 [2025-01-09 06:04:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:40,936 INFO L471 AbstractCegarLoop]: Abstraction has 7891 states and 10061 transitions. [2025-01-09 06:04:40,937 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:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7891 states and 10061 transitions. [2025-01-09 06:04:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 06:04:40,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:40,939 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:40,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:04:40,939 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:40,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash 620692198, now seen corresponding path program 1 times [2025-01-09 06:04:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504137258] [2025-01-09 06:04:40,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:40,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 06:04:40,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 06:04:40,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:40,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:41,029 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:41,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504137258] [2025-01-09 06:04:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504137258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:41,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202768574] [2025-01-09 06:04:41,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:41,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:41,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:41,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:41,031 INFO L87 Difference]: Start difference. First operand 7891 states and 10061 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:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:42,660 INFO L93 Difference]: Finished difference Result 23506 states and 30047 transitions. [2025-01-09 06:04:42,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 06:04:42,661 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:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:42,732 INFO L225 Difference]: With dead ends: 23506 [2025-01-09 06:04:42,733 INFO L226 Difference]: Without dead ends: 15867 [2025-01-09 06:04:42,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:04:42,760 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 641 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:42,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1388 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15867 states. [2025-01-09 06:04:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15867 to 14784. [2025-01-09 06:04:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14784 states, 11248 states have (on average 1.227773826458037) internal successors, (13810), 11440 states have internal predecessors, (13810), 1757 states have call successors, (1757), 1427 states have call predecessors, (1757), 1777 states have return successors, (3196), 1929 states have call predecessors, (3196), 1756 states have call successors, (3196) [2025-01-09 06:04:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14784 states to 14784 states and 18763 transitions. [2025-01-09 06:04:43,961 INFO L78 Accepts]: Start accepts. Automaton has 14784 states and 18763 transitions. Word has length 80 [2025-01-09 06:04:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:43,962 INFO L471 AbstractCegarLoop]: Abstraction has 14784 states and 18763 transitions. [2025-01-09 06:04:43,962 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:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 14784 states and 18763 transitions. [2025-01-09 06:04:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 06:04:43,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:43,968 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:43,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:04:43,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:43,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1401544730, now seen corresponding path program 1 times [2025-01-09 06:04:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49268855] [2025-01-09 06:04:43,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:43,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:43,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 06:04:43,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 06:04:43,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:43,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:44,067 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:44,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:44,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49268855] [2025-01-09 06:04:44,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49268855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:44,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:04:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680925291] [2025-01-09 06:04:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:44,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:44,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:44,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:44,068 INFO L87 Difference]: Start difference. First operand 14784 states and 18763 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:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:45,548 INFO L93 Difference]: Finished difference Result 29527 states and 37377 transitions. [2025-01-09 06:04:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:04:45,548 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:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:45,637 INFO L225 Difference]: With dead ends: 29527 [2025-01-09 06:04:45,637 INFO L226 Difference]: Without dead ends: 15873 [2025-01-09 06:04:45,682 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:45,683 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 1295 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:45,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 1463 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:04:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15873 states. [2025-01-09 06:04:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15873 to 14784. [2025-01-09 06:04:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14784 states, 11248 states have (on average 1.2092816500711236) internal successors, (13602), 11440 states have internal predecessors, (13602), 1757 states have call successors, (1757), 1427 states have call predecessors, (1757), 1777 states have return successors, (2991), 1929 states have call predecessors, (2991), 1756 states have call successors, (2991) [2025-01-09 06:04:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14784 states to 14784 states and 18350 transitions. [2025-01-09 06:04:46,686 INFO L78 Accepts]: Start accepts. Automaton has 14784 states and 18350 transitions. Word has length 86 [2025-01-09 06:04:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:46,686 INFO L471 AbstractCegarLoop]: Abstraction has 14784 states and 18350 transitions. [2025-01-09 06:04:46,686 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:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 14784 states and 18350 transitions. [2025-01-09 06:04:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:04:46,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:46,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:46,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:04:46,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:46,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:46,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1799555092, now seen corresponding path program 1 times [2025-01-09 06:04:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402748524] [2025-01-09 06:04:46,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:46,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:04:46,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:04:46,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:46,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:46,851 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:46,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:46,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402748524] [2025-01-09 06:04:46,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402748524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:46,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:46,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:46,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446249115] [2025-01-09 06:04:46,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:46,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:46,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:46,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:46,854 INFO L87 Difference]: Start difference. First operand 14784 states and 18350 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:47,374 INFO L93 Difference]: Finished difference Result 15001 states and 18685 transitions. [2025-01-09 06:04:47,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:47,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 06:04:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:47,445 INFO L225 Difference]: With dead ends: 15001 [2025-01-09 06:04:47,445 INFO L226 Difference]: Without dead ends: 14784 [2025-01-09 06:04:47,457 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:47,458 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 339 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 597 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:47,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 597 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:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14784 states. [2025-01-09 06:04:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14784 to 14784. [2025-01-09 06:04:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14784 states, 11248 states have (on average 1.209192745376956) internal successors, (13601), 11440 states have internal predecessors, (13601), 1757 states have call successors, (1757), 1427 states have call predecessors, (1757), 1777 states have return successors, (2991), 1929 states have call predecessors, (2991), 1756 states have call successors, (2991) [2025-01-09 06:04:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14784 states to 14784 states and 18349 transitions. [2025-01-09 06:04:48,741 INFO L78 Accepts]: Start accepts. Automaton has 14784 states and 18349 transitions. Word has length 110 [2025-01-09 06:04:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:48,741 INFO L471 AbstractCegarLoop]: Abstraction has 14784 states and 18349 transitions. [2025-01-09 06:04:48,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14784 states and 18349 transitions. [2025-01-09 06:04:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:04:48,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:48,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:48,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:04:48,752 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:48,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash -97941674, now seen corresponding path program 1 times [2025-01-09 06:04:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098424503] [2025-01-09 06:04:48,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:48,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:04:48,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:04:48,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:48,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:48,954 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:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098424503] [2025-01-09 06:04:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098424503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:48,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:48,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134419242] [2025-01-09 06:04:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:48,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:48,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:48,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:48,957 INFO L87 Difference]: Start difference. First operand 14784 states and 18349 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:50,412 INFO L93 Difference]: Finished difference Result 15246 states and 19082 transitions. [2025-01-09 06:04:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:50,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 06:04:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:50,480 INFO L225 Difference]: With dead ends: 15246 [2025-01-09 06:04:50,480 INFO L226 Difference]: Without dead ends: 15035 [2025-01-09 06:04:50,490 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:50,491 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 799 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:50,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 2072 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15035 states. [2025-01-09 06:04:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15035 to 15005. [2025-01-09 06:04:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15005 states, 11444 states have (on average 1.2154840964697657) internal successors, (13910), 11638 states have internal predecessors, (13910), 1774 states have call successors, (1774), 1433 states have call predecessors, (1774), 1785 states have return successors, (3015), 1947 states have call predecessors, (3015), 1773 states have call successors, (3015) [2025-01-09 06:04:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15005 states to 15005 states and 18699 transitions. [2025-01-09 06:04:51,631 INFO L78 Accepts]: Start accepts. Automaton has 15005 states and 18699 transitions. Word has length 110 [2025-01-09 06:04:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:51,631 INFO L471 AbstractCegarLoop]: Abstraction has 15005 states and 18699 transitions. [2025-01-09 06:04:51,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 15005 states and 18699 transitions. [2025-01-09 06:04:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:04:51,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:51,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:51,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:04:51,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:51,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash -126441964, now seen corresponding path program 1 times [2025-01-09 06:04:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:51,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898032804] [2025-01-09 06:04:51,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:51,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:04:51,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:04:51,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:51,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:51,741 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:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898032804] [2025-01-09 06:04:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898032804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443051792] [2025-01-09 06:04:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:51,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:51,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:51,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:51,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:51,745 INFO L87 Difference]: Start difference. First operand 15005 states and 18699 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:53,762 INFO L93 Difference]: Finished difference Result 15908 states and 20131 transitions. [2025-01-09 06:04:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 06:04:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:53,836 INFO L225 Difference]: With dead ends: 15908 [2025-01-09 06:04:53,837 INFO L226 Difference]: Without dead ends: 15478 [2025-01-09 06:04:53,850 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:53,851 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 795 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:53,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1963 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15478 states. [2025-01-09 06:04:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15478 to 15437. [2025-01-09 06:04:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15437 states, 11830 states have (on average 1.2269653423499578) internal successors, (14515), 12028 states have internal predecessors, (14515), 1804 states have call successors, (1804), 1445 states have call predecessors, (1804), 1801 states have return successors, (3061), 1979 states have call predecessors, (3061), 1803 states have call successors, (3061) [2025-01-09 06:04:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15437 states to 15437 states and 19380 transitions. [2025-01-09 06:04:55,204 INFO L78 Accepts]: Start accepts. Automaton has 15437 states and 19380 transitions. Word has length 110 [2025-01-09 06:04:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:55,204 INFO L471 AbstractCegarLoop]: Abstraction has 15437 states and 19380 transitions. [2025-01-09 06:04:55,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 15437 states and 19380 transitions. [2025-01-09 06:04:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:04:55,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:55,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:55,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:04:55,214 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:55,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2067023978, now seen corresponding path program 1 times [2025-01-09 06:04:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313674743] [2025-01-09 06:04:55,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:55,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:04:55,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:04:55,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:55,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:55,299 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:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:55,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313674743] [2025-01-09 06:04:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313674743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:55,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066579156] [2025-01-09 06:04:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:55,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:55,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:55,301 INFO L87 Difference]: Start difference. First operand 15437 states and 19380 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:56,902 INFO L93 Difference]: Finished difference Result 17293 states and 22358 transitions. [2025-01-09 06:04:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 06:04:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:56,971 INFO L225 Difference]: With dead ends: 17293 [2025-01-09 06:04:56,971 INFO L226 Difference]: Without dead ends: 16431 [2025-01-09 06:04:56,980 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:56,982 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 790 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:56,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1958 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16431 states. [2025-01-09 06:04:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16431 to 16369. [2025-01-09 06:04:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16369 states, 12664 states have (on average 1.250868603916614) internal successors, (15841), 12876 states have internal predecessors, (15841), 1864 states have call successors, (1864), 1469 states have call predecessors, (1864), 1839 states have return successors, (3177), 2043 states have call predecessors, (3177), 1863 states have call successors, (3177) [2025-01-09 06:04:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16369 states to 16369 states and 20882 transitions. [2025-01-09 06:04:58,845 INFO L78 Accepts]: Start accepts. Automaton has 16369 states and 20882 transitions. Word has length 110 [2025-01-09 06:04:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:58,845 INFO L471 AbstractCegarLoop]: Abstraction has 16369 states and 20882 transitions. [2025-01-09 06:04:58,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 16369 states and 20882 transitions. [2025-01-09 06:04:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:04:58,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:58,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:58,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:04:58,854 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:58,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash -189960748, now seen corresponding path program 1 times [2025-01-09 06:04:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:58,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721302411] [2025-01-09 06:04:58,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:58,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:58,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:04:58,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:04:58,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:58,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:58,941 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:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:58,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721302411] [2025-01-09 06:04:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721302411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:58,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:58,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735815417] [2025-01-09 06:04:58,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:58,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:58,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:58,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:58,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:58,944 INFO L87 Difference]: Start difference. First operand 16369 states and 20882 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:00,840 INFO L93 Difference]: Finished difference Result 20316 states and 27360 transitions. [2025-01-09 06:05:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 06:05:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:00,915 INFO L225 Difference]: With dead ends: 20316 [2025-01-09 06:05:00,916 INFO L226 Difference]: Without dead ends: 18522 [2025-01-09 06:05:00,926 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:05:00,927 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 785 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:00,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1937 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18522 states. [2025-01-09 06:05:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18522 to 18421. [2025-01-09 06:05:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18421 states, 14502 states have (on average 1.2971314301475658) internal successors, (18811), 14760 states have internal predecessors, (18811), 1984 states have call successors, (1984), 1517 states have call predecessors, (1984), 1933 states have return successors, (3505), 2171 states have call predecessors, (3505), 1983 states have call successors, (3505) [2025-01-09 06:05:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18421 states to 18421 states and 24300 transitions. [2025-01-09 06:05:02,692 INFO L78 Accepts]: Start accepts. Automaton has 18421 states and 24300 transitions. Word has length 110 [2025-01-09 06:05:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:02,696 INFO L471 AbstractCegarLoop]: Abstraction has 18421 states and 24300 transitions. [2025-01-09 06:05:02,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 18421 states and 24300 transitions. [2025-01-09 06:05:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:05:02,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:02,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:02,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:05:02,718 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:02,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:02,718 INFO L85 PathProgramCache]: Analyzing trace with hash -960694314, now seen corresponding path program 1 times [2025-01-09 06:05:02,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:02,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015168958] [2025-01-09 06:05:02,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:02,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:02,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:05:02,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:05:02,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:02,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:02,871 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:05:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015168958] [2025-01-09 06:05:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015168958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570596711] [2025-01-09 06:05:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:02,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:02,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:02,872 INFO L87 Difference]: Start difference. First operand 18421 states and 24300 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)