./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:07:10,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:07:10,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:07:10,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:07:10,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:07:10,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:07:10,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:07:10,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:07:10,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:07:10,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:07:10,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:07:10,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:07:10,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:07:10,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:10,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:07:10,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:10,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:07:10,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:07:10,133 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 -> 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb [2025-01-09 06:07:10,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:07:10,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:07:10,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:07:10,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:07:10,422 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:07:10,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2025-01-09 06:07:11,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9043e781/bc216324fafa419bb1a2d61a0b2b92e5/FLAG76ef87c1d [2025-01-09 06:07:11,924 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:07:11,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2025-01-09 06:07:11,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9043e781/bc216324fafa419bb1a2d61a0b2b92e5/FLAG76ef87c1d [2025-01-09 06:07:11,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9043e781/bc216324fafa419bb1a2d61a0b2b92e5 [2025-01-09 06:07:11,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:07:11,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:07:11,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:07:11,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:07:11,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:07:11,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:07:11" (1/1) ... [2025-01-09 06:07:11,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a752b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:11, skipping insertion in model container [2025-01-09 06:07:11,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:07:11" (1/1) ... [2025-01-09 06:07:12,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:07:12,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[911,924] [2025-01-09 06:07:12,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[8416,8429] [2025-01-09 06:07:12,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:07:12,271 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:07:12,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[911,924] [2025-01-09 06:07:12,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[8416,8429] [2025-01-09 06:07:12,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:07:12,375 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:07:12,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12 WrapperNode [2025-01-09 06:07:12,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:07:12,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:07:12,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:07:12,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:07:12,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,435 INFO L138 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 821 [2025-01-09 06:07:12,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:07:12,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:07:12,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:07:12,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:07:12,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,467 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 06:07:12,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:07:12,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:07:12,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:07:12,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:07:12,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (1/1) ... [2025-01-09 06:07:12,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:12,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:07:12,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:07:12,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:07:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:07:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:07:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:07:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:07:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:07:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:07:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:07:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:07:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:07:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:07:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:07:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:07:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:07:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:07:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:07:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:07:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:07:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:07:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:07:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:07:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:07:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:07:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:07:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:07:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:07:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:07:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:07:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:07:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:07:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:07:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:07:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:07:12,662 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:07:12,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:07:13,258 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:07:13,259 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-01-09 06:07:13,438 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-01-09 06:07:13,438 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:07:13,474 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:07:13,474 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 06:07:13,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:13 BoogieIcfgContainer [2025-01-09 06:07:13,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:07:13,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:07:13,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:07:13,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:07:13,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:07:11" (1/3) ... [2025-01-09 06:07:13,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e10ffa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:13, skipping insertion in model container [2025-01-09 06:07:13,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:12" (2/3) ... [2025-01-09 06:07:13,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e10ffa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:13, skipping insertion in model container [2025-01-09 06:07:13,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:13" (3/3) ... [2025-01-09 06:07:13,481 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.08.cil-1.c [2025-01-09 06:07:13,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:07:13,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.08.cil-1.c that has 15 procedures, 393 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-01-09 06:07:13,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:07:13,578 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;@2824bec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:07:13,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:07:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 393 states, 340 states have (on average 1.576470588235294) internal successors, (536), 344 states have internal predecessors, (536), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 06:07:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:13,593 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:13,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:13,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:13,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash -955682815, now seen corresponding path program 1 times [2025-01-09 06:07:13,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323244590] [2025-01-09 06:07:13,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:13,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:13,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:13,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:13,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323244590] [2025-01-09 06:07:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323244590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:13,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:13,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015902190] [2025-01-09 06:07:13,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:13,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:13,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:13,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:13,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:13,982 INFO L87 Difference]: Start difference. First operand has 393 states, 340 states have (on average 1.576470588235294) internal successors, (536), 344 states have internal predecessors, (536), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:14,739 INFO L93 Difference]: Finished difference Result 877 states and 1363 transitions. [2025-01-09 06:07:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:14,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-01-09 06:07:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:14,751 INFO L225 Difference]: With dead ends: 877 [2025-01-09 06:07:14,752 INFO L226 Difference]: Without dead ends: 498 [2025-01-09 06:07:14,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:14,761 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 436 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:14,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1256 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-01-09 06:07:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 491. [2025-01-09 06:07:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 416 states have (on average 1.5192307692307692) internal successors, (632), 422 states have internal predecessors, (632), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2025-01-09 06:07:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 737 transitions. [2025-01-09 06:07:14,821 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 737 transitions. Word has length 63 [2025-01-09 06:07:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:14,821 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 737 transitions. [2025-01-09 06:07:14,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 737 transitions. [2025-01-09 06:07:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:14,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:14,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:14,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:07:14,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:14,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1052765889, now seen corresponding path program 1 times [2025-01-09 06:07:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:14,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918990348] [2025-01-09 06:07:14,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:14,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:14,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:14,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:14,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918990348] [2025-01-09 06:07:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918990348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:14,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:14,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:14,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470230936] [2025-01-09 06:07:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:14,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:14,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:14,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:14,994 INFO L87 Difference]: Start difference. First operand 491 states and 737 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:15,725 INFO L93 Difference]: Finished difference Result 846 states and 1240 transitions. [2025-01-09 06:07:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:15,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-01-09 06:07:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:15,730 INFO L225 Difference]: With dead ends: 846 [2025-01-09 06:07:15,730 INFO L226 Difference]: Without dead ends: 645 [2025-01-09 06:07:15,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:15,732 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 854 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:15,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1346 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-01-09 06:07:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 599. [2025-01-09 06:07:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 502 states have (on average 1.50199203187251) internal successors, (754), 510 states have internal predecessors, (754), 64 states have call successors, (64), 28 states have call predecessors, (64), 31 states have return successors, (75), 64 states have call predecessors, (75), 62 states have call successors, (75) [2025-01-09 06:07:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 893 transitions. [2025-01-09 06:07:15,766 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 893 transitions. Word has length 63 [2025-01-09 06:07:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:15,766 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 893 transitions. [2025-01-09 06:07:15,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 893 transitions. [2025-01-09 06:07:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:15,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:15,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:15,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:07:15,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1037247171, now seen corresponding path program 1 times [2025-01-09 06:07:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:15,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90793217] [2025-01-09 06:07:15,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:15,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:15,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:15,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:15,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:15,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90793217] [2025-01-09 06:07:15,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90793217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:15,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:15,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210035950] [2025-01-09 06:07:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:15,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:15,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:15,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:15,840 INFO L87 Difference]: Start difference. First operand 599 states and 893 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:16,054 INFO L93 Difference]: Finished difference Result 1469 states and 2139 transitions. [2025-01-09 06:07:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:16,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-01-09 06:07:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:16,064 INFO L225 Difference]: With dead ends: 1469 [2025-01-09 06:07:16,064 INFO L226 Difference]: Without dead ends: 1166 [2025-01-09 06:07:16,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:16,070 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 676 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:16,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1321 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:07:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-01-09 06:07:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1149. [2025-01-09 06:07:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 942 states have (on average 1.4458598726114649) internal successors, (1362), 958 states have internal predecessors, (1362), 124 states have call successors, (124), 70 states have call predecessors, (124), 81 states have return successors, (160), 124 states have call predecessors, (160), 122 states have call successors, (160) [2025-01-09 06:07:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1646 transitions. [2025-01-09 06:07:16,143 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1646 transitions. Word has length 63 [2025-01-09 06:07:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:16,143 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1646 transitions. [2025-01-09 06:07:16,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1646 transitions. [2025-01-09 06:07:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:07:16,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:16,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:16,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:07:16,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:16,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash 742002332, now seen corresponding path program 1 times [2025-01-09 06:07:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600506802] [2025-01-09 06:07:16,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:07:16,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:07:16,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:16,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600506802] [2025-01-09 06:07:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600506802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:16,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:16,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970673762] [2025-01-09 06:07:16,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:16,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:16,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:16,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:16,245 INFO L87 Difference]: Start difference. First operand 1149 states and 1646 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:16,336 INFO L93 Difference]: Finished difference Result 2022 states and 2880 transitions. [2025-01-09 06:07:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-01-09 06:07:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:16,344 INFO L225 Difference]: With dead ends: 2022 [2025-01-09 06:07:16,344 INFO L226 Difference]: Without dead ends: 1169 [2025-01-09 06:07:16,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:16,349 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 0 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:16,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2894 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-01-09 06:07:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2025-01-09 06:07:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 958 states have (on average 1.4331941544885178) internal successors, (1373), 974 states have internal predecessors, (1373), 124 states have call successors, (124), 70 states have call predecessors, (124), 85 states have return successors, (167), 128 states have call predecessors, (167), 122 states have call successors, (167) [2025-01-09 06:07:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1664 transitions. [2025-01-09 06:07:16,440 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1664 transitions. Word has length 64 [2025-01-09 06:07:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:16,440 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1664 transitions. [2025-01-09 06:07:16,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1664 transitions. [2025-01-09 06:07:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:07:16,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:16,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:16,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:07:16,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:16,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash 347635546, now seen corresponding path program 1 times [2025-01-09 06:07:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822812625] [2025-01-09 06:07:16,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:16,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:07:16,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:07:16,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:16,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822812625] [2025-01-09 06:07:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822812625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:16,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:16,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697928674] [2025-01-09 06:07:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:16,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:16,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:16,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:16,526 INFO L87 Difference]: Start difference. First operand 1169 states and 1664 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:17,066 INFO L93 Difference]: Finished difference Result 3631 states and 5101 transitions. [2025-01-09 06:07:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:07:17,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-01-09 06:07:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:17,073 INFO L225 Difference]: With dead ends: 3631 [2025-01-09 06:07:17,073 INFO L226 Difference]: Without dead ends: 1459 [2025-01-09 06:07:17,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:17,078 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 1653 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:17,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 2360 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-01-09 06:07:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1094. [2025-01-09 06:07:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 883 states have (on average 1.40317100792752) internal successors, (1239), 899 states have internal predecessors, (1239), 124 states have call successors, (124), 70 states have call predecessors, (124), 85 states have return successors, (155), 128 states have call predecessors, (155), 122 states have call successors, (155) [2025-01-09 06:07:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1518 transitions. [2025-01-09 06:07:17,133 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1518 transitions. Word has length 64 [2025-01-09 06:07:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:17,133 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1518 transitions. [2025-01-09 06:07:17,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1518 transitions. [2025-01-09 06:07:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:17,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:17,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:17,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:07:17,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:17,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -341307527, now seen corresponding path program 1 times [2025-01-09 06:07:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:17,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430482216] [2025-01-09 06:07:17,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:17,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:17,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:17,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:17,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430482216] [2025-01-09 06:07:17,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430482216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:17,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:07:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706122513] [2025-01-09 06:07:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:17,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:07:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:17,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:07:17,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:07:17,251 INFO L87 Difference]: Start difference. First operand 1094 states and 1518 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:18,020 INFO L93 Difference]: Finished difference Result 2173 states and 2964 transitions. [2025-01-09 06:07:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:07:18,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-01-09 06:07:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:18,023 INFO L225 Difference]: With dead ends: 2173 [2025-01-09 06:07:18,023 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 06:07:18,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:07:18,028 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1054 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:18,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1473 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 06:07:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-01-09 06:07:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.562753036437247) internal successors, (386), 248 states have internal predecessors, (386), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 06:07:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 430 transitions. [2025-01-09 06:07:18,040 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 430 transitions. Word has length 65 [2025-01-09 06:07:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:18,040 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 430 transitions. [2025-01-09 06:07:18,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 430 transitions. [2025-01-09 06:07:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:18,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:18,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:18,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:07:18,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:18,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash -767605422, now seen corresponding path program 1 times [2025-01-09 06:07:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:18,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679641175] [2025-01-09 06:07:18,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:18,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:18,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:18,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:18,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679641175] [2025-01-09 06:07:18,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679641175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:18,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:18,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:18,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94172262] [2025-01-09 06:07:18,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:18,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:18,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:18,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:18,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:18,100 INFO L87 Difference]: Start difference. First operand 276 states and 430 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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:07:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:18,113 INFO L93 Difference]: Finished difference Result 539 states and 839 transitions. [2025-01-09 06:07:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:18,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:18,115 INFO L225 Difference]: With dead ends: 539 [2025-01-09 06:07:18,116 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 06:07:18,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:18,117 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 417 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:18,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 429 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 06:07:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-01-09 06:07:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.5587044534412955) internal successors, (385), 248 states have internal predecessors, (385), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 06:07:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 429 transitions. [2025-01-09 06:07:18,127 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 429 transitions. Word has length 132 [2025-01-09 06:07:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:18,127 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 429 transitions. [2025-01-09 06:07:18,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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:07:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 429 transitions. [2025-01-09 06:07:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:18,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:18,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:18,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:07:18,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:18,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1074870292, now seen corresponding path program 1 times [2025-01-09 06:07:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:18,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345442114] [2025-01-09 06:07:18,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:18,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:18,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:18,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:18,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:18,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345442114] [2025-01-09 06:07:18,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345442114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:18,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:18,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86658593] [2025-01-09 06:07:18,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:18,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:18,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:18,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:18,230 INFO L87 Difference]: Start difference. First operand 276 states and 429 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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:07:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:18,582 INFO L93 Difference]: Finished difference Result 826 states and 1299 transitions. [2025-01-09 06:07:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:18,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:18,587 INFO L225 Difference]: With dead ends: 826 [2025-01-09 06:07:18,587 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 06:07:18,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:18,589 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 809 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:18,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1170 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:07:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 06:07:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 546. [2025-01-09 06:07:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 493 states have (on average 1.5720081135902637) internal successors, (775), 495 states have internal predecessors, (775), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-01-09 06:07:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 854 transitions. [2025-01-09 06:07:18,611 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 854 transitions. Word has length 132 [2025-01-09 06:07:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:18,611 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 854 transitions. [2025-01-09 06:07:18,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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:07:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 854 transitions. [2025-01-09 06:07:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:18,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:18,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:18,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:07:18,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:18,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1958009752, now seen corresponding path program 1 times [2025-01-09 06:07:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:18,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896314661] [2025-01-09 06:07:18,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:18,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:18,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:18,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:18,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:18,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:18,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896314661] [2025-01-09 06:07:18,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896314661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:18,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:18,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650575332] [2025-01-09 06:07:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:18,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:18,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:18,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:18,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:18,752 INFO L87 Difference]: Start difference. First operand 546 states and 854 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:19,285 INFO L93 Difference]: Finished difference Result 1419 states and 2246 transitions. [2025-01-09 06:07:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:19,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:19,290 INFO L225 Difference]: With dead ends: 1419 [2025-01-09 06:07:19,290 INFO L226 Difference]: Without dead ends: 890 [2025-01-09 06:07:19,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:19,292 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 811 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:19,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 2238 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-01-09 06:07:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 797. [2025-01-09 06:07:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 720 states have (on average 1.5652777777777778) internal successors, (1127), 723 states have internal predecessors, (1127), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-01-09 06:07:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1243 transitions. [2025-01-09 06:07:19,321 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1243 transitions. Word has length 132 [2025-01-09 06:07:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:19,321 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1243 transitions. [2025-01-09 06:07:19,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1243 transitions. [2025-01-09 06:07:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:19,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:19,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:19,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:07:19,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:19,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1865601194, now seen corresponding path program 1 times [2025-01-09 06:07:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:19,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094640597] [2025-01-09 06:07:19,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:19,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:19,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:19,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:19,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:19,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094640597] [2025-01-09 06:07:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094640597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:19,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:19,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406106247] [2025-01-09 06:07:19,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:19,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:19,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:19,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:19,436 INFO L87 Difference]: Start difference. First operand 797 states and 1243 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:19,962 INFO L93 Difference]: Finished difference Result 2218 states and 3504 transitions. [2025-01-09 06:07:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:19,968 INFO L225 Difference]: With dead ends: 2218 [2025-01-09 06:07:19,968 INFO L226 Difference]: Without dead ends: 1438 [2025-01-09 06:07:19,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:19,971 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 806 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:19,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2222 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-01-09 06:07:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1332. [2025-01-09 06:07:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1205 states have (on average 1.5684647302904564) internal successors, (1890), 1212 states have internal predecessors, (1890), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-01-09 06:07:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2086 transitions. [2025-01-09 06:07:20,018 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2086 transitions. Word has length 132 [2025-01-09 06:07:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:20,018 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 2086 transitions. [2025-01-09 06:07:20,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2086 transitions. [2025-01-09 06:07:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:20,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:20,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:20,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:07:20,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:20,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 782003160, now seen corresponding path program 1 times [2025-01-09 06:07:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921673369] [2025-01-09 06:07:20,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:20,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:20,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:20,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:20,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:20,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:20,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:20,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921673369] [2025-01-09 06:07:20,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921673369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:20,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:20,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:20,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516203134] [2025-01-09 06:07:20,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:20,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:20,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:20,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:20,136 INFO L87 Difference]: Start difference. First operand 1332 states and 2086 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:20,666 INFO L93 Difference]: Finished difference Result 3927 states and 6245 transitions. [2025-01-09 06:07:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:20,676 INFO L225 Difference]: With dead ends: 3927 [2025-01-09 06:07:20,676 INFO L226 Difference]: Without dead ends: 2612 [2025-01-09 06:07:20,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:20,679 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 824 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:20,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1559 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2025-01-09 06:07:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2486. [2025-01-09 06:07:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2253 states have (on average 1.5818908122503328) internal successors, (3564), 2274 states have internal predecessors, (3564), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-01-09 06:07:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3944 transitions. [2025-01-09 06:07:20,781 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3944 transitions. Word has length 132 [2025-01-09 06:07:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:20,781 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3944 transitions. [2025-01-09 06:07:20,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3944 transitions. [2025-01-09 06:07:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:20,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:20,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:07:20,785 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:20,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash -256581414, now seen corresponding path program 1 times [2025-01-09 06:07:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:20,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846544701] [2025-01-09 06:07:20,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:20,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:20,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:20,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:20,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:20,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846544701] [2025-01-09 06:07:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846544701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:20,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:20,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541141586] [2025-01-09 06:07:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:20,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:20,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:20,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:20,884 INFO L87 Difference]: Start difference. First operand 2486 states and 3944 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:07:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:21,202 INFO L93 Difference]: Finished difference Result 5361 states and 8670 transitions. [2025-01-09 06:07:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:21,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:21,216 INFO L225 Difference]: With dead ends: 5361 [2025-01-09 06:07:21,216 INFO L226 Difference]: Without dead ends: 2892 [2025-01-09 06:07:21,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:21,224 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 571 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:21,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 824 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:07:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2025-01-09 06:07:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2486. [2025-01-09 06:07:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2253 states have (on average 1.577896138482024) internal successors, (3555), 2274 states have internal predecessors, (3555), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-01-09 06:07:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3935 transitions. [2025-01-09 06:07:21,356 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3935 transitions. Word has length 132 [2025-01-09 06:07:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:21,356 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3935 transitions. [2025-01-09 06:07:21,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:07:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3935 transitions. [2025-01-09 06:07:21,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:21,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:21,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:21,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:07:21,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:21,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2065220504, now seen corresponding path program 1 times [2025-01-09 06:07:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974828704] [2025-01-09 06:07:21,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:21,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:21,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:21,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:21,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974828704] [2025-01-09 06:07:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974828704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:21,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:21,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152836162] [2025-01-09 06:07:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:21,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:21,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:21,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:21,446 INFO L87 Difference]: Start difference. First operand 2486 states and 3935 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:07:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:21,759 INFO L93 Difference]: Finished difference Result 5332 states and 8594 transitions. [2025-01-09 06:07:21,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:21,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:21,772 INFO L225 Difference]: With dead ends: 5332 [2025-01-09 06:07:21,772 INFO L226 Difference]: Without dead ends: 2863 [2025-01-09 06:07:21,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:21,779 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 568 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:21,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 816 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:07:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2025-01-09 06:07:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2486. [2025-01-09 06:07:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2253 states have (on average 1.573901464713715) internal successors, (3546), 2274 states have internal predecessors, (3546), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-01-09 06:07:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3926 transitions. [2025-01-09 06:07:21,880 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3926 transitions. Word has length 132 [2025-01-09 06:07:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:21,881 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3926 transitions. [2025-01-09 06:07:21,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:07:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3926 transitions. [2025-01-09 06:07:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:21,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:21,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:21,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:07:21,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:21,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -76639974, now seen corresponding path program 1 times [2025-01-09 06:07:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:21,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176798145] [2025-01-09 06:07:21,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:21,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:21,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:21,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:21,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176798145] [2025-01-09 06:07:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176798145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:21,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:21,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:21,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163380865] [2025-01-09 06:07:21,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:21,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:21,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:21,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:21,965 INFO L87 Difference]: Start difference. First operand 2486 states and 3926 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:07:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:22,301 INFO L93 Difference]: Finished difference Result 5303 states and 8518 transitions. [2025-01-09 06:07:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:22,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:22,315 INFO L225 Difference]: With dead ends: 5303 [2025-01-09 06:07:22,315 INFO L226 Difference]: Without dead ends: 2834 [2025-01-09 06:07:22,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:22,322 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 565 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:22,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 808 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:07:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2025-01-09 06:07:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2486. [2025-01-09 06:07:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2253 states have (on average 1.569906790945406) internal successors, (3537), 2274 states have internal predecessors, (3537), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-01-09 06:07:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3917 transitions. [2025-01-09 06:07:22,428 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3917 transitions. Word has length 132 [2025-01-09 06:07:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:22,429 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3917 transitions. [2025-01-09 06:07:22,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:07:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3917 transitions. [2025-01-09 06:07:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:22,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:22,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:07:22,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:22,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -699921576, now seen corresponding path program 1 times [2025-01-09 06:07:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:22,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28343967] [2025-01-09 06:07:22,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:22,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:22,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:22,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:22,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:22,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28343967] [2025-01-09 06:07:22,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28343967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:22,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:22,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778121227] [2025-01-09 06:07:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:22,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:22,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:22,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:22,571 INFO L87 Difference]: Start difference. First operand 2486 states and 3917 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:23,214 INFO L93 Difference]: Finished difference Result 7567 states and 12132 transitions. [2025-01-09 06:07:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:23,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:23,241 INFO L225 Difference]: With dead ends: 7567 [2025-01-09 06:07:23,244 INFO L226 Difference]: Without dead ends: 5098 [2025-01-09 06:07:23,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:23,252 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 769 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:23,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 2127 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2025-01-09 06:07:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4956. [2025-01-09 06:07:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4493 states have (on average 1.5862452704206544) internal successors, (7127), 4560 states have internal predecessors, (7127), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-01-09 06:07:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 7971 transitions. [2025-01-09 06:07:23,543 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 7971 transitions. Word has length 132 [2025-01-09 06:07:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:23,544 INFO L471 AbstractCegarLoop]: Abstraction has 4956 states and 7971 transitions. [2025-01-09 06:07:23,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 7971 transitions. [2025-01-09 06:07:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:23,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:23,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:23,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:07:23,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:23,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash -581480102, now seen corresponding path program 1 times [2025-01-09 06:07:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:23,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442662649] [2025-01-09 06:07:23,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:23,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:23,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:23,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:23,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:23,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442662649] [2025-01-09 06:07:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442662649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:23,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516653128] [2025-01-09 06:07:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:23,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:23,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:23,659 INFO L87 Difference]: Start difference. First operand 4956 states and 7971 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:24,593 INFO L93 Difference]: Finished difference Result 16535 states and 27161 transitions. [2025-01-09 06:07:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:24,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:24,640 INFO L225 Difference]: With dead ends: 16535 [2025-01-09 06:07:24,640 INFO L226 Difference]: Without dead ends: 11596 [2025-01-09 06:07:24,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:24,654 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 847 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:24,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 2102 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11596 states. [2025-01-09 06:07:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11596 to 10361. [2025-01-09 06:07:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10361 states, 9400 states have (on average 1.6096808510638299) internal successors, (15131), 9613 states have internal predecessors, (15131), 550 states have call successors, (550), 198 states have call predecessors, (550), 410 states have return successors, (1574), 581 states have call predecessors, (1574), 550 states have call successors, (1574) [2025-01-09 06:07:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10361 states to 10361 states and 17255 transitions. [2025-01-09 06:07:25,195 INFO L78 Accepts]: Start accepts. Automaton has 10361 states and 17255 transitions. Word has length 132 [2025-01-09 06:07:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:25,197 INFO L471 AbstractCegarLoop]: Abstraction has 10361 states and 17255 transitions. [2025-01-09 06:07:25,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 10361 states and 17255 transitions. [2025-01-09 06:07:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:25,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:25,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:07:25,204 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:25,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash 807813912, now seen corresponding path program 1 times [2025-01-09 06:07:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9187727] [2025-01-09 06:07:25,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:25,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:25,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:25,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:25,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9187727] [2025-01-09 06:07:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9187727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:25,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635998282] [2025-01-09 06:07:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:25,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:25,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:25,325 INFO L87 Difference]: Start difference. First operand 10361 states and 17255 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:26,643 INFO L93 Difference]: Finished difference Result 34972 states and 60171 transitions. [2025-01-09 06:07:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:26,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:26,724 INFO L225 Difference]: With dead ends: 34972 [2025-01-09 06:07:26,724 INFO L226 Difference]: Without dead ends: 24628 [2025-01-09 06:07:26,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:26,755 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 982 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:26,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 2086 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24628 states. [2025-01-09 06:07:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24628 to 22372. [2025-01-09 06:07:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22372 states, 20269 states have (on average 1.634762445113227) internal successors, (33135), 20936 states have internal predecessors, (33135), 1046 states have call successors, (1046), 390 states have call predecessors, (1046), 1056 states have return successors, (5142), 1109 states have call predecessors, (5142), 1046 states have call successors, (5142) [2025-01-09 06:07:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22372 states to 22372 states and 39323 transitions. [2025-01-09 06:07:28,078 INFO L78 Accepts]: Start accepts. Automaton has 22372 states and 39323 transitions. Word has length 132 [2025-01-09 06:07:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:28,079 INFO L471 AbstractCegarLoop]: Abstraction has 22372 states and 39323 transitions. [2025-01-09 06:07:28,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 22372 states and 39323 transitions. [2025-01-09 06:07:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:28,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:28,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:28,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:07:28,090 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:28,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:28,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1225580134, now seen corresponding path program 1 times [2025-01-09 06:07:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206054101] [2025-01-09 06:07:28,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:28,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:28,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:28,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:28,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:28,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:28,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206054101] [2025-01-09 06:07:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206054101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:28,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:28,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074972701] [2025-01-09 06:07:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:28,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:28,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:28,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:28,212 INFO L87 Difference]: Start difference. First operand 22372 states and 39323 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:30,496 INFO L93 Difference]: Finished difference Result 74939 states and 138529 transitions. [2025-01-09 06:07:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:30,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:30,797 INFO L225 Difference]: With dead ends: 74939 [2025-01-09 06:07:30,797 INFO L226 Difference]: Without dead ends: 52584 [2025-01-09 06:07:30,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:30,843 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 950 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:30,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 1475 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52584 states. [2025-01-09 06:07:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52584 to 49342. [2025-01-09 06:07:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49342 states, 44501 states have (on average 1.6549066313116558) internal successors, (73645), 46562 states have internal predecessors, (73645), 2006 states have call successors, (2006), 774 states have call predecessors, (2006), 2834 states have return successors, (18390), 2133 states have call predecessors, (18390), 2006 states have call successors, (18390) [2025-01-09 06:07:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49342 states to 49342 states and 94041 transitions. [2025-01-09 06:07:34,083 INFO L78 Accepts]: Start accepts. Automaton has 49342 states and 94041 transitions. Word has length 132 [2025-01-09 06:07:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:34,084 INFO L471 AbstractCegarLoop]: Abstraction has 49342 states and 94041 transitions. [2025-01-09 06:07:34,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 49342 states and 94041 transitions. [2025-01-09 06:07:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:34,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:34,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:34,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:07:34,107 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:34,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1762244764, now seen corresponding path program 1 times [2025-01-09 06:07:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176477659] [2025-01-09 06:07:34,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:34,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:34,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:34,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:34,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176477659] [2025-01-09 06:07:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176477659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:34,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:34,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350922] [2025-01-09 06:07:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:34,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:34,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:34,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:34,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:34,405 INFO L87 Difference]: Start difference. First operand 49342 states and 94041 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:39,124 INFO L93 Difference]: Finished difference Result 165849 states and 342117 transitions. [2025-01-09 06:07:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:39,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-01-09 06:07:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:39,820 INFO L225 Difference]: With dead ends: 165849 [2025-01-09 06:07:39,820 INFO L226 Difference]: Without dead ends: 116524 [2025-01-09 06:07:40,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:40,026 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 880 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:40,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 2052 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116524 states. [2025-01-09 06:07:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116524 to 111109. [2025-01-09 06:07:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111109 states, 99398 states have (on average 1.6714320207650053) internal successors, (166137), 105705 states have internal predecessors, (166137), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 7848 states have return successors, (69398), 4117 states have call predecessors, (69398), 3862 states have call successors, (69398) [2025-01-09 06:07:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111109 states to 111109 states and 239397 transitions. [2025-01-09 06:07:47,964 INFO L78 Accepts]: Start accepts. Automaton has 111109 states and 239397 transitions. Word has length 132 [2025-01-09 06:07:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:47,965 INFO L471 AbstractCegarLoop]: Abstraction has 111109 states and 239397 transitions. [2025-01-09 06:07:47,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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:07:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 111109 states and 239397 transitions. [2025-01-09 06:07:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:07:48,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:48,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:48,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:07:48,004 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:48,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash -635225766, now seen corresponding path program 1 times [2025-01-09 06:07:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:48,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171878635] [2025-01-09 06:07:48,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:48,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:07:48,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:07:48,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:48,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:48,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171878635] [2025-01-09 06:07:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171878635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402826401] [2025-01-09 06:07:48,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:48,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:48,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:48,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:48,112 INFO L87 Difference]: Start difference. First operand 111109 states and 239397 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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)