./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.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/Problem05_label46+token_ring.09.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 858df747258432440d8be7960c85c9b1ad66b3a3b967b98ccb7c6efb60152481 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:23:46,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:23:46,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:23:46,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:23:46,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:23:46,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:23:46,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:23:46,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:23:46,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:23:46,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:23:46,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:23:46,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:23:46,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:23:46,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:23:46,940 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:23:46,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:23:46,941 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:23:46,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:23:46,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:23:46,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:23:46,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:23:46,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:23:46,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:23:46,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:23:46,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:23:46,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:23:46,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:23:46,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:23:46,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:23:46,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:23:46,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:23:46,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:23:46,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:23:46,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:23:46,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:23:46,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:23:46,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:23:46,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:23:46,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:23:46,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:23:46,945 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 -> 858df747258432440d8be7960c85c9b1ad66b3a3b967b98ccb7c6efb60152481 [2025-01-09 05:23:47,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:23:47,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:23:47,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:23:47,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:23:47,282 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:23:47,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-1.c [2025-01-09 05:23:48,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d80aec49/7a561b4f6ab747b7a7ab8abf14d916ce/FLAGe00a95c69 [2025-01-09 05:23:49,452 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:23:49,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-1.c [2025-01-09 05:23:49,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d80aec49/7a561b4f6ab747b7a7ab8abf14d916ce/FLAGe00a95c69 [2025-01-09 05:23:49,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d80aec49/7a561b4f6ab747b7a7ab8abf14d916ce [2025-01-09 05:23:49,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:23:49,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:23:49,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:23:49,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:23:49,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:23:49,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:23:49" (1/1) ... [2025-01-09 05:23:49,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418604de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:49, skipping insertion in model container [2025-01-09 05:23:49,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:23:49" (1/1) ... [2025-01-09 05:23:49,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:23:51,141 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/Problem05_label46+token_ring.09.cil-1.c[382357,382370] [2025-01-09 05:23:51,175 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/Problem05_label46+token_ring.09.cil-1.c[383339,383352] [2025-01-09 05:23:51,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:23:51,436 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:23:52,044 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/Problem05_label46+token_ring.09.cil-1.c[382357,382370] [2025-01-09 05:23:52,049 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/Problem05_label46+token_ring.09.cil-1.c[383339,383352] [2025-01-09 05:23:52,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:23:52,162 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:23:52,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52 WrapperNode [2025-01-09 05:23:52,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:23:52,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:23:52,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:23:52,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:23:52,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:52,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:52,826 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13014 [2025-01-09 05:23:52,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:23:52,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:23:52,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:23:52,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:23:52,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:52,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:52,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,054 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 05:23:53,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:23:53,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:23:53,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:23:53,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:23:53,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (1/1) ... [2025-01-09 05:23:53,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:23:53,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:23:53,475 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 05:23:53,479 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 05:23:53,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:23:53,503 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:23:53,504 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:23:53,504 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:23:53,504 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:23:53,504 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:23:53,504 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:23:53,504 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:23:53,504 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:23:53,504 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:23:53,504 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:23:53,504 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:23:53,505 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:23:53,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:23:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:23:53,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:23:53,642 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:23:53,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:24:01,992 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2025-01-09 05:24:01,993 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:24:02,087 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:24:02,089 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 05:24:02,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:24:02 BoogieIcfgContainer [2025-01-09 05:24:02,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:24:02,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:24:02,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:24:02,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:24:02,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:23:49" (1/3) ... [2025-01-09 05:24:02,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef4b0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:24:02, skipping insertion in model container [2025-01-09 05:24:02,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:52" (2/3) ... [2025-01-09 05:24:02,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef4b0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:24:02, skipping insertion in model container [2025-01-09 05:24:02,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:24:02" (3/3) ... [2025-01-09 05:24:02,101 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.09.cil-1.c [2025-01-09 05:24:02,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:24:02,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.09.cil-1.c that has 7 procedures, 2488 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 05:24:02,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:24:02,263 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;@1983e80d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:24:02,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:24:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:24:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:02,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:02,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:02,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:02,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash 313623087, now seen corresponding path program 1 times [2025-01-09 05:24:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725222046] [2025-01-09 05:24:02,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:02,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:02,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:02,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:02,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:02,718 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 05:24:02,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725222046] [2025-01-09 05:24:02,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725222046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:02,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:24:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031586537] [2025-01-09 05:24:02,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:02,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:24:02,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:02,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:24:02,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:24:02,755 INFO L87 Difference]: Start difference. First operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 05:24:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:03,004 INFO L93 Difference]: Finished difference Result 4967 states and 9125 transitions. [2025-01-09 05:24:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:24:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:03,045 INFO L225 Difference]: With dead ends: 4967 [2025-01-09 05:24:03,046 INFO L226 Difference]: Without dead ends: 2421 [2025-01-09 05:24:03,059 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 05:24:03,062 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 465 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 8517 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 05:24:03,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 8517 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:24:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-01-09 05:24:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2421. [2025-01-09 05:24:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2390 states have (on average 1.8330543933054393) internal successors, (4381), 2392 states have internal predecessors, (4381), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:24:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4427 transitions. [2025-01-09 05:24:03,228 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4427 transitions. Word has length 143 [2025-01-09 05:24:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:03,231 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4427 transitions. [2025-01-09 05:24:03,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 05:24:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4427 transitions. [2025-01-09 05:24:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:03,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:03,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:03,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:24:03,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:03,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash 858495661, now seen corresponding path program 1 times [2025-01-09 05:24:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:03,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647339540] [2025-01-09 05:24:03,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:03,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:03,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:03,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:03,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:03,574 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 05:24:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:03,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647339540] [2025-01-09 05:24:03,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647339540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:03,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:03,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:03,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745546782] [2025-01-09 05:24:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:03,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:03,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:03,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:03,581 INFO L87 Difference]: Start difference. First operand 2421 states and 4427 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 05:24:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:04,261 INFO L93 Difference]: Finished difference Result 3023 states and 5383 transitions. [2025-01-09 05:24:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:24:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:04,279 INFO L225 Difference]: With dead ends: 3023 [2025-01-09 05:24:04,280 INFO L226 Difference]: Without dead ends: 2740 [2025-01-09 05:24:04,283 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 05:24:04,284 INFO L435 NwaCegarLoop]: 4321 mSDtfsCounter, 4851 mSDsluCounter, 8836 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4868 SdHoareTripleChecker+Valid, 13157 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:04,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4868 Valid, 13157 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:24:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2025-01-09 05:24:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2717. [2025-01-09 05:24:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2661 states have (on average 1.8083427282976325) internal successors, (4812), 2664 states have internal predecessors, (4812), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-01-09 05:24:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4895 transitions. [2025-01-09 05:24:04,371 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4895 transitions. Word has length 143 [2025-01-09 05:24:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:04,372 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4895 transitions. [2025-01-09 05:24:04,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 05:24:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4895 transitions. [2025-01-09 05:24:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:04,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:04,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:04,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:24:04,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1915106511, now seen corresponding path program 1 times [2025-01-09 05:24:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372871324] [2025-01-09 05:24:04,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:04,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:04,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:04,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:04,698 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 05:24:04,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372871324] [2025-01-09 05:24:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372871324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763097631] [2025-01-09 05:24:04,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:04,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:04,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:04,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:04,701 INFO L87 Difference]: Start difference. First operand 2717 states and 4895 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:05,628 INFO L93 Difference]: Finished difference Result 3674 states and 6428 transitions. [2025-01-09 05:24:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:05,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:05,648 INFO L225 Difference]: With dead ends: 3674 [2025-01-09 05:24:05,648 INFO L226 Difference]: Without dead ends: 3095 [2025-01-09 05:24:05,654 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 05:24:05,656 INFO L435 NwaCegarLoop]: 4567 mSDtfsCounter, 4855 mSDsluCounter, 13728 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 18295 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:05,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 18295 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:24:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2025-01-09 05:24:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2992. [2025-01-09 05:24:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2992 states, 2911 states have (on average 1.7866712469941601) internal successors, (5201), 2915 states have internal predecessors, (5201), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-01-09 05:24:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 5323 transitions. [2025-01-09 05:24:05,763 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 5323 transitions. Word has length 143 [2025-01-09 05:24:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:05,764 INFO L471 AbstractCegarLoop]: Abstraction has 2992 states and 5323 transitions. [2025-01-09 05:24:05,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 5323 transitions. [2025-01-09 05:24:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:05,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:05,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:05,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:24:05,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:05,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash 329451887, now seen corresponding path program 1 times [2025-01-09 05:24:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:05,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052954058] [2025-01-09 05:24:05,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:05,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:05,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:05,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:05,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:05,965 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 05:24:05,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:05,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052954058] [2025-01-09 05:24:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052954058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:05,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221003998] [2025-01-09 05:24:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:05,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:05,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:05,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:05,969 INFO L87 Difference]: Start difference. First operand 2992 states and 5323 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:06,755 INFO L93 Difference]: Finished difference Result 4543 states and 7799 transitions. [2025-01-09 05:24:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:06,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:06,781 INFO L225 Difference]: With dead ends: 4543 [2025-01-09 05:24:06,781 INFO L226 Difference]: Without dead ends: 3689 [2025-01-09 05:24:06,786 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 05:24:06,788 INFO L435 NwaCegarLoop]: 4559 mSDtfsCounter, 4847 mSDsluCounter, 13706 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 18265 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:06,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 18265 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-01-09 05:24:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3576. [2025-01-09 05:24:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3443 states have (on average 1.7542840546035434) internal successors, (6040), 3451 states have internal predecessors, (6040), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-01-09 05:24:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 6246 transitions. [2025-01-09 05:24:06,931 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 6246 transitions. Word has length 143 [2025-01-09 05:24:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:06,932 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 6246 transitions. [2025-01-09 05:24:06,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 6246 transitions. [2025-01-09 05:24:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:06,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:06,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:06,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:24:06,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:06,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -763183315, now seen corresponding path program 1 times [2025-01-09 05:24:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277207261] [2025-01-09 05:24:06,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:06,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:06,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:06,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:06,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:07,275 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 05:24:07,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:07,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277207261] [2025-01-09 05:24:07,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277207261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:07,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:07,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916525746] [2025-01-09 05:24:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:07,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:07,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:07,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:07,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:07,279 INFO L87 Difference]: Start difference. First operand 3576 states and 6246 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:08,392 INFO L93 Difference]: Finished difference Result 6423 states and 10828 transitions. [2025-01-09 05:24:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:08,420 INFO L225 Difference]: With dead ends: 6423 [2025-01-09 05:24:08,420 INFO L226 Difference]: Without dead ends: 4985 [2025-01-09 05:24:08,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:24:08,428 INFO L435 NwaCegarLoop]: 4556 mSDtfsCounter, 4842 mSDsluCounter, 13697 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4859 SdHoareTripleChecker+Valid, 18253 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:08,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4859 Valid, 18253 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:24:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2025-01-09 05:24:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4843. [2025-01-09 05:24:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4600 states have (on average 1.7165217391304348) internal successors, (7896), 4622 states have internal predecessors, (7896), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-01-09 05:24:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 8294 transitions. [2025-01-09 05:24:08,620 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 8294 transitions. Word has length 143 [2025-01-09 05:24:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:08,621 INFO L471 AbstractCegarLoop]: Abstraction has 4843 states and 8294 transitions. [2025-01-09 05:24:08,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 8294 transitions. [2025-01-09 05:24:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:08,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:08,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:08,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:24:08,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:08,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2045355601, now seen corresponding path program 1 times [2025-01-09 05:24:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:08,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673887323] [2025-01-09 05:24:08,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:08,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:08,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:08,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:08,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:08,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:08,789 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 05:24:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673887323] [2025-01-09 05:24:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673887323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012674330] [2025-01-09 05:24:08,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:08,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:08,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:08,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:08,791 INFO L87 Difference]: Start difference. First operand 4843 states and 8294 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:09,700 INFO L93 Difference]: Finished difference Result 10560 states and 17682 transitions. [2025-01-09 05:24:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:09,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:09,751 INFO L225 Difference]: With dead ends: 10560 [2025-01-09 05:24:09,755 INFO L226 Difference]: Without dead ends: 7855 [2025-01-09 05:24:09,767 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 05:24:09,768 INFO L435 NwaCegarLoop]: 4553 mSDtfsCounter, 4837 mSDsluCounter, 13688 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4854 SdHoareTripleChecker+Valid, 18241 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:09,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4854 Valid, 18241 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:24:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7855 states. [2025-01-09 05:24:10,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7855 to 7656. [2025-01-09 05:24:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7656 states, 7175 states have (on average 1.6875261324041813) internal successors, (12108), 7243 states have internal predecessors, (12108), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 05:24:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 12986 transitions. [2025-01-09 05:24:10,074 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 12986 transitions. Word has length 143 [2025-01-09 05:24:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:10,074 INFO L471 AbstractCegarLoop]: Abstraction has 7656 states and 12986 transitions. [2025-01-09 05:24:10,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 12986 transitions. [2025-01-09 05:24:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:10,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:10,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:24:10,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:10,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 407135981, now seen corresponding path program 1 times [2025-01-09 05:24:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94955421] [2025-01-09 05:24:10,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:10,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:10,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:10,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:10,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:10,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94955421] [2025-01-09 05:24:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94955421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:10,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:10,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047025266] [2025-01-09 05:24:10,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:10,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:10,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:10,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:10,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:10,238 INFO L87 Difference]: Start difference. First operand 7656 states and 12986 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:11,222 INFO L93 Difference]: Finished difference Result 19891 states and 33756 transitions. [2025-01-09 05:24:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:11,301 INFO L225 Difference]: With dead ends: 19891 [2025-01-09 05:24:11,301 INFO L226 Difference]: Without dead ends: 14373 [2025-01-09 05:24:11,329 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 05:24:11,330 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 4864 mSDsluCounter, 13191 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4881 SdHoareTripleChecker+Valid, 17534 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:11,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4881 Valid, 17534 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:24:11,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14373 states. [2025-01-09 05:24:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14373 to 14065. [2025-01-09 05:24:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14065 states, 13054 states have (on average 1.67979163474797) internal successors, (21928), 13268 states have internal predecessors, (21928), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:24:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14065 states to 14065 states and 24150 transitions. [2025-01-09 05:24:12,237 INFO L78 Accepts]: Start accepts. Automaton has 14065 states and 24150 transitions. Word has length 143 [2025-01-09 05:24:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:12,237 INFO L471 AbstractCegarLoop]: Abstraction has 14065 states and 24150 transitions. [2025-01-09 05:24:12,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14065 states and 24150 transitions. [2025-01-09 05:24:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:12,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:12,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:12,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:24:12,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:12,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1314866705, now seen corresponding path program 1 times [2025-01-09 05:24:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:12,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389502330] [2025-01-09 05:24:12,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:12,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:12,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:12,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:12,458 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 05:24:12,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:12,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389502330] [2025-01-09 05:24:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389502330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:12,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:12,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594655811] [2025-01-09 05:24:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:12,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:12,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:12,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:12,460 INFO L87 Difference]: Start difference. First operand 14065 states and 24150 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:13,262 INFO L93 Difference]: Finished difference Result 29422 states and 51531 transitions. [2025-01-09 05:24:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:24:13,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:13,346 INFO L225 Difference]: With dead ends: 29422 [2025-01-09 05:24:13,346 INFO L226 Difference]: Without dead ends: 17495 [2025-01-09 05:24:13,397 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 05:24:13,399 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4585 mSDsluCounter, 8471 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4602 SdHoareTripleChecker+Valid, 12769 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:13,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4602 Valid, 12769 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:24:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17495 states. [2025-01-09 05:24:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17495 to 14065. [2025-01-09 05:24:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14065 states, 13054 states have (on average 1.6772636739696645) internal successors, (21895), 13268 states have internal predecessors, (21895), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:24:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14065 states to 14065 states and 24117 transitions. [2025-01-09 05:24:14,165 INFO L78 Accepts]: Start accepts. Automaton has 14065 states and 24117 transitions. Word has length 143 [2025-01-09 05:24:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:14,166 INFO L471 AbstractCegarLoop]: Abstraction has 14065 states and 24117 transitions. [2025-01-09 05:24:14,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 14065 states and 24117 transitions. [2025-01-09 05:24:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:14,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:14,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:14,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:24:14,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:14,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1647509843, now seen corresponding path program 1 times [2025-01-09 05:24:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517418468] [2025-01-09 05:24:14,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:14,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:14,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:14,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:14,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:14,389 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 05:24:14,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:14,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517418468] [2025-01-09 05:24:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517418468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:14,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:14,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390156487] [2025-01-09 05:24:14,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:14,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:14,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:14,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:14,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:14,390 INFO L87 Difference]: Start difference. First operand 14065 states and 24117 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:16,608 INFO L93 Difference]: Finished difference Result 41232 states and 72411 transitions. [2025-01-09 05:24:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:16,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:16,770 INFO L225 Difference]: With dead ends: 41232 [2025-01-09 05:24:16,770 INFO L226 Difference]: Without dead ends: 29305 [2025-01-09 05:24:16,815 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 05:24:16,816 INFO L435 NwaCegarLoop]: 4542 mSDtfsCounter, 4819 mSDsluCounter, 13656 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4836 SdHoareTripleChecker+Valid, 18198 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:16,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4836 Valid, 18198 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 05:24:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29305 states. [2025-01-09 05:24:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29305 to 28827. [2025-01-09 05:24:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28827 states, 26594 states have (on average 1.687937128675641) internal successors, (44889), 27262 states have internal predecessors, (44889), 1175 states have call successors, (1175), 390 states have call predecessors, (1175), 1056 states have return successors, (5271), 1238 states have call predecessors, (5271), 1175 states have call successors, (5271) [2025-01-09 05:24:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28827 states to 28827 states and 51335 transitions. [2025-01-09 05:24:18,091 INFO L78 Accepts]: Start accepts. Automaton has 28827 states and 51335 transitions. Word has length 143 [2025-01-09 05:24:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:18,092 INFO L471 AbstractCegarLoop]: Abstraction has 28827 states and 51335 transitions. [2025-01-09 05:24:18,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 28827 states and 51335 transitions. [2025-01-09 05:24:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:18,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:18,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:18,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:24:18,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:18,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash 281422383, now seen corresponding path program 1 times [2025-01-09 05:24:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:18,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320235944] [2025-01-09 05:24:18,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:18,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:18,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:18,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:18,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:18,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:18,454 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 05:24:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:18,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320235944] [2025-01-09 05:24:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320235944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:18,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674562253] [2025-01-09 05:24:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:18,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:18,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:18,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:18,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:18,457 INFO L87 Difference]: Start difference. First operand 28827 states and 51335 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:21,184 INFO L93 Difference]: Finished difference Result 91456 states and 170595 transitions. [2025-01-09 05:24:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:21,754 INFO L225 Difference]: With dead ends: 91456 [2025-01-09 05:24:21,755 INFO L226 Difference]: Without dead ends: 64767 [2025-01-09 05:24:21,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:24:21,872 INFO L435 NwaCegarLoop]: 4539 mSDtfsCounter, 4814 mSDsluCounter, 13647 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4831 SdHoareTripleChecker+Valid, 18186 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:21,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4831 Valid, 18186 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:24:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64767 states. [2025-01-09 05:24:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64767 to 63940. [2025-01-09 05:24:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63940 states, 58777 states have (on average 1.7109583680691427) internal successors, (100565), 60839 states have internal predecessors, (100565), 2327 states have call successors, (2327), 774 states have call predecessors, (2327), 2834 states have return successors, (18711), 2454 states have call predecessors, (18711), 2327 states have call successors, (18711) [2025-01-09 05:24:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63940 states to 63940 states and 121603 transitions. [2025-01-09 05:24:25,014 INFO L78 Accepts]: Start accepts. Automaton has 63940 states and 121603 transitions. Word has length 143 [2025-01-09 05:24:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:25,015 INFO L471 AbstractCegarLoop]: Abstraction has 63940 states and 121603 transitions. [2025-01-09 05:24:25,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 63940 states and 121603 transitions. [2025-01-09 05:24:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:25,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:25,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:25,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:24:25,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2011658643, now seen corresponding path program 1 times [2025-01-09 05:24:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463472536] [2025-01-09 05:24:25,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:25,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:25,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:25,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:25,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:25,187 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 05:24:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463472536] [2025-01-09 05:24:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463472536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:25,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:25,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201337292] [2025-01-09 05:24:25,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:25,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:25,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:25,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:25,190 INFO L87 Difference]: Start difference. First operand 63940 states and 121603 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:30,831 INFO L93 Difference]: Finished difference Result 218103 states and 440698 transitions. [2025-01-09 05:24:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:30,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:24:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:31,851 INFO L225 Difference]: With dead ends: 218103 [2025-01-09 05:24:31,851 INFO L226 Difference]: Without dead ends: 156301 [2025-01-09 05:24:32,072 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 05:24:32,073 INFO L435 NwaCegarLoop]: 4529 mSDtfsCounter, 4888 mSDsluCounter, 13614 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 18143 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:32,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 18143 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:24:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156301 states. [2025-01-09 05:24:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156301 to 146392. [2025-01-09 05:24:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146392 states, 134039 states have (on average 1.7350994859705011) internal successors, (232571), 140347 states have internal predecessors, (232571), 4503 states have call successors, (4503), 1542 states have call predecessors, (4503), 7848 states have return successors, (70039), 4758 states have call predecessors, (70039), 4503 states have call successors, (70039) [2025-01-09 05:24:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146392 states to 146392 states and 307113 transitions. [2025-01-09 05:24:41,133 INFO L78 Accepts]: Start accepts. Automaton has 146392 states and 307113 transitions. Word has length 143 [2025-01-09 05:24:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:41,134 INFO L471 AbstractCegarLoop]: Abstraction has 146392 states and 307113 transitions. [2025-01-09 05:24:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 05:24:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 146392 states and 307113 transitions. [2025-01-09 05:24:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:24:41,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:41,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:41,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:24:41,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:41,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1540302293, now seen corresponding path program 1 times [2025-01-09 05:24:41,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:41,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008469336] [2025-01-09 05:24:41,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:41,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:41,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:24:41,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:24:41,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:41,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:41,329 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 05:24:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008469336] [2025-01-09 05:24:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008469336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706490017] [2025-01-09 05:24:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:41,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:41,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:41,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:41,330 INFO L87 Difference]: Start difference. First operand 146392 states and 307113 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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)