./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:15:48,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:15:48,345 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:15:48,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:15:48,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:15:48,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:15:48,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:15:48,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:15:48,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:15:48,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:15:48,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:15:48,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:15:48,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:15:48,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:15:48,393 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:15:48,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:15:48,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:15:48,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:15:48,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:15:48,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:15:48,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:15:48,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:15:48,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:15:48,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:15:48,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:15:48,396 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 -> cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 [2025-01-09 05:15:48,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:15:48,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:15:48,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:15:48,704 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:15:48,704 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:15:48,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2025-01-09 05:15:50,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfb8f3770/44b5e303e43648a79a26c659aeb15467/FLAG7faced88d [2025-01-09 05:15:50,681 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:15:50,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2025-01-09 05:15:50,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfb8f3770/44b5e303e43648a79a26c659aeb15467/FLAG7faced88d [2025-01-09 05:15:50,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfb8f3770/44b5e303e43648a79a26c659aeb15467 [2025-01-09 05:15:50,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:15:50,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:15:50,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:15:50,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:15:50,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:15:50,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:15:50" (1/1) ... [2025-01-09 05:15:50,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:50, skipping insertion in model container [2025-01-09 05:15:50,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:15:50" (1/1) ... [2025-01-09 05:15:50,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:15:52,247 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_label42+token_ring.01.cil-2.c[378560,378573] [2025-01-09 05:15:52,286 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_label42+token_ring.01.cil-2.c[383339,383352] [2025-01-09 05:15:52,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:15:52,523 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:15:53,222 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_label42+token_ring.01.cil-2.c[378560,378573] [2025-01-09 05:15:53,238 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_label42+token_ring.01.cil-2.c[383339,383352] [2025-01-09 05:15:53,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:15:53,321 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:15:53,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53 WrapperNode [2025-01-09 05:15:53,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:15:53,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:15:53,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:15:53,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:15:53,333 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:15:53" (1/1) ... [2025-01-09 05:15:53,419 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:15:53" (1/1) ... [2025-01-09 05:15:53,783 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12564 [2025-01-09 05:15:53,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:15:53,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:15:53,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:15:53,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:15:53,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:53,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:53,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,033 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:15:54,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:15:54,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:15:54,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:15:54,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:15:54,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (1/1) ... [2025-01-09 05:15:54,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:15:54,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:15:54,511 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:15:54,516 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:15:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:15:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:15:54,541 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:15:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:15:54,541 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:15:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:15:54,541 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:15:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:15:54,541 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:15:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:15:54,542 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:15:54,542 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:15:54,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:15:54,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:15:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:15:54,543 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:15:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:15:54,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:15:54,648 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:15:54,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:16:02,807 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2025-01-09 05:16:02,808 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:16:02,875 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:16:02,876 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 05:16:02,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:16:02 BoogieIcfgContainer [2025-01-09 05:16:02,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:16:02,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:16:02,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:16:02,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:16:02,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:15:50" (1/3) ... [2025-01-09 05:16:02,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64307ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:16:02, skipping insertion in model container [2025-01-09 05:16:02,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:53" (2/3) ... [2025-01-09 05:16:02,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64307ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:16:02, skipping insertion in model container [2025-01-09 05:16:02,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:16:02" (3/3) ... [2025-01-09 05:16:02,888 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.01.cil-2.c [2025-01-09 05:16:02,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:16:02,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.01.cil-2.c that has 8 procedures, 2296 locations, 1 initial locations, 5 loop locations, and 2 error locations. [2025-01-09 05:16:03,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:16:03,025 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;@73c0b3d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:16:03,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:16:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 2296 states, 2270 states have (on average 1.8568281938325992) internal successors, (4215), 2274 states have internal predecessors, (4215), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 05:16:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:16:03,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:03,049 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] [2025-01-09 05:16:03,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:03,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash 566562286, now seen corresponding path program 1 times [2025-01-09 05:16:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273887181] [2025-01-09 05:16:03,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:03,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:16:03,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:16:03,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:03,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:03,429 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:16:03,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:03,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273887181] [2025-01-09 05:16:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273887181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:03,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:03,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:16:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037846214] [2025-01-09 05:16:03,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:03,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:03,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:03,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:16:03,461 INFO L87 Difference]: Start difference. First operand has 2296 states, 2270 states have (on average 1.8568281938325992) internal successors, (4215), 2274 states have internal predecessors, (4215), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:03,925 INFO L93 Difference]: Finished difference Result 4687 states and 8645 transitions. [2025-01-09 05:16:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:16:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-01-09 05:16:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:03,962 INFO L225 Difference]: With dead ends: 4687 [2025-01-09 05:16:03,963 INFO L226 Difference]: Without dead ends: 2330 [2025-01-09 05:16:03,976 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:16:03,982 INFO L435 NwaCegarLoop]: 4147 mSDtfsCounter, 4253 mSDsluCounter, 8340 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4262 SdHoareTripleChecker+Valid, 12487 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:03,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4262 Valid, 12487 Invalid, 224 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:16:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-01-09 05:16:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2321. [2025-01-09 05:16:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2279 states have (on average 1.8398420359806933) internal successors, (4193), 2283 states have internal predecessors, (4193), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2025-01-09 05:16:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4246 transitions. [2025-01-09 05:16:04,159 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4246 transitions. Word has length 56 [2025-01-09 05:16:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:04,160 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4246 transitions. [2025-01-09 05:16:04,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4246 transitions. [2025-01-09 05:16:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:16:04,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:04,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:04,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:16:04,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:04,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1263970838, now seen corresponding path program 1 times [2025-01-09 05:16:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:04,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370237919] [2025-01-09 05:16:04,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:04,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:16:04,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:16:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:04,570 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:16:04,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:04,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370237919] [2025-01-09 05:16:04,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370237919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:04,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:04,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77855965] [2025-01-09 05:16:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:04,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:04,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:04,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:04,577 INFO L87 Difference]: Start difference. First operand 2321 states and 4246 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:05,106 INFO L93 Difference]: Finished difference Result 2625 states and 4685 transitions. [2025-01-09 05:16:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:05,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-01-09 05:16:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:05,121 INFO L225 Difference]: With dead ends: 2625 [2025-01-09 05:16:05,121 INFO L226 Difference]: Without dead ends: 2434 [2025-01-09 05:16:05,124 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:16:05,125 INFO L435 NwaCegarLoop]: 4150 mSDtfsCounter, 4173 mSDsluCounter, 12404 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4182 SdHoareTripleChecker+Valid, 16554 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:05,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4182 Valid, 16554 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-01-09 05:16:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2409. [2025-01-09 05:16:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 2350 states have (on average 1.8280851063829788) internal successors, (4296), 2355 states have internal predecessors, (4296), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2025-01-09 05:16:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 4372 transitions. [2025-01-09 05:16:05,228 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 4372 transitions. Word has length 56 [2025-01-09 05:16:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:05,228 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 4372 transitions. [2025-01-09 05:16:05,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 4372 transitions. [2025-01-09 05:16:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:16:05,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:05,232 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] [2025-01-09 05:16:05,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:16:05,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:05,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2133603180, now seen corresponding path program 1 times [2025-01-09 05:16:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905764250] [2025-01-09 05:16:05,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:05,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:16:05,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:16:05,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:05,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:05,395 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:16:05,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905764250] [2025-01-09 05:16:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905764250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:05,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411661072] [2025-01-09 05:16:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:05,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:05,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:05,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:05,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:05,397 INFO L87 Difference]: Start difference. First operand 2409 states and 4372 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:05,825 INFO L93 Difference]: Finished difference Result 2917 states and 5103 transitions. [2025-01-09 05:16:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:05,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-01-09 05:16:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:05,842 INFO L225 Difference]: With dead ends: 2917 [2025-01-09 05:16:05,842 INFO L226 Difference]: Without dead ends: 2638 [2025-01-09 05:16:05,845 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:16:05,845 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4212 mSDsluCounter, 12381 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4223 SdHoareTripleChecker+Valid, 16525 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:05,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4223 Valid, 16525 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:16:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2025-01-09 05:16:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2584. [2025-01-09 05:16:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2491 states have (on average 1.806904857486953) internal successors, (4501), 2500 states have internal predecessors, (4501), 55 states have call successors, (55), 31 states have call predecessors, (55), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2025-01-09 05:16:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4625 transitions. [2025-01-09 05:16:05,949 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 4625 transitions. Word has length 56 [2025-01-09 05:16:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:05,950 INFO L471 AbstractCegarLoop]: Abstraction has 2584 states and 4625 transitions. [2025-01-09 05:16:05,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 4625 transitions. [2025-01-09 05:16:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:16:05,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:05,952 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] [2025-01-09 05:16:05,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:16:05,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:05,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1913217622, now seen corresponding path program 1 times [2025-01-09 05:16:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:05,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138368930] [2025-01-09 05:16:05,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:05,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:16:05,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:16:05,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:05,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:06,073 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:16:06,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:06,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138368930] [2025-01-09 05:16:06,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138368930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:06,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:06,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51926749] [2025-01-09 05:16:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:06,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:06,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:06,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:06,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:06,077 INFO L87 Difference]: Start difference. First operand 2584 states and 4625 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:06,502 INFO L93 Difference]: Finished difference Result 3432 states and 5858 transitions. [2025-01-09 05:16:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:06,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-01-09 05:16:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:06,523 INFO L225 Difference]: With dead ends: 3432 [2025-01-09 05:16:06,523 INFO L226 Difference]: Without dead ends: 2978 [2025-01-09 05:16:06,529 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:16:06,532 INFO L435 NwaCegarLoop]: 4138 mSDtfsCounter, 4165 mSDsluCounter, 12371 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 16509 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:06,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4173 Valid, 16509 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:16:06,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2025-01-09 05:16:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2895. [2025-01-09 05:16:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2734 states have (on average 1.768471104608632) internal successors, (4835), 2757 states have internal predecessors, (4835), 87 states have call successors, (87), 53 states have call predecessors, (87), 72 states have return successors, (149), 92 states have call predecessors, (149), 85 states have call successors, (149) [2025-01-09 05:16:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 5071 transitions. [2025-01-09 05:16:06,725 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 5071 transitions. Word has length 56 [2025-01-09 05:16:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:06,725 INFO L471 AbstractCegarLoop]: Abstraction has 2895 states and 5071 transitions. [2025-01-09 05:16:06,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 5071 transitions. [2025-01-09 05:16:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:16:06,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:06,731 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] [2025-01-09 05:16:06,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:16:06,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:06,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1489570900, now seen corresponding path program 1 times [2025-01-09 05:16:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:06,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316474435] [2025-01-09 05:16:06,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:06,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:16:06,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:16:06,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:06,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:06,803 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:16:06,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:06,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316474435] [2025-01-09 05:16:06,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316474435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:06,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:06,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:16:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619019858] [2025-01-09 05:16:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:06,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:16:06,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:06,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:16:06,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:16:06,805 INFO L87 Difference]: Start difference. First operand 2895 states and 5071 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:06,984 INFO L93 Difference]: Finished difference Result 4076 states and 6792 transitions. [2025-01-09 05:16:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:16:06,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-01-09 05:16:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:07,002 INFO L225 Difference]: With dead ends: 4076 [2025-01-09 05:16:07,003 INFO L226 Difference]: Without dead ends: 3312 [2025-01-09 05:16:07,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:16:07,009 INFO L435 NwaCegarLoop]: 4219 mSDtfsCounter, 4200 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4200 SdHoareTripleChecker+Valid, 8381 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:07,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4200 Valid, 8381 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:16:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2025-01-09 05:16:07,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3289. [2025-01-09 05:16:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3043 states have (on average 1.7223135064081498) internal successors, (5241), 3077 states have internal predecessors, (5241), 136 states have call successors, (136), 83 states have call predecessors, (136), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2025-01-09 05:16:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 5588 transitions. [2025-01-09 05:16:07,156 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 5588 transitions. Word has length 56 [2025-01-09 05:16:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:07,157 INFO L471 AbstractCegarLoop]: Abstraction has 3289 states and 5588 transitions. [2025-01-09 05:16:07,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 5588 transitions. [2025-01-09 05:16:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:16:07,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:07,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:07,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:16:07,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:07,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1693896382, now seen corresponding path program 1 times [2025-01-09 05:16:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:07,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836463369] [2025-01-09 05:16:07,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:07,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:16:07,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:16:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:16:07,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:07,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836463369] [2025-01-09 05:16:07,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836463369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:07,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472580397] [2025-01-09 05:16:07,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:07,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:07,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:07,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:07,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:16:07,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:16:07,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:16:07,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:07,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:16:07,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:16:07,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472580397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:16:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694243014] [2025-01-09 05:16:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:07,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:07,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:07,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:07,416 INFO L87 Difference]: Start difference. First operand 3289 states and 5588 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 05:16:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:07,557 INFO L93 Difference]: Finished difference Result 5494 states and 8724 transitions. [2025-01-09 05:16:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:07,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2025-01-09 05:16:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:07,584 INFO L225 Difference]: With dead ends: 5494 [2025-01-09 05:16:07,585 INFO L226 Difference]: Without dead ends: 4337 [2025-01-09 05:16:07,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:07,592 INFO L435 NwaCegarLoop]: 4225 mSDtfsCounter, 113 mSDsluCounter, 4105 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 8330 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:07,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 8330 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2025-01-09 05:16:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 4337. [2025-01-09 05:16:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4337 states, 3868 states have (on average 1.642450879007239) internal successors, (6353), 3929 states have internal predecessors, (6353), 255 states have call successors, (255), 161 states have call predecessors, (255), 212 states have return successors, (440), 262 states have call predecessors, (440), 253 states have call successors, (440) [2025-01-09 05:16:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 7048 transitions. [2025-01-09 05:16:07,888 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 7048 transitions. Word has length 90 [2025-01-09 05:16:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:07,889 INFO L471 AbstractCegarLoop]: Abstraction has 4337 states and 7048 transitions. [2025-01-09 05:16:07,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 05:16:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 7048 transitions. [2025-01-09 05:16:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 05:16:07,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:07,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:07,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:16:08,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:08,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:08,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:08,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1956487086, now seen corresponding path program 1 times [2025-01-09 05:16:08,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:08,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039112196] [2025-01-09 05:16:08,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:08,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 05:16:08,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 05:16:08,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:08,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 05:16:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:08,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039112196] [2025-01-09 05:16:08,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039112196] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:08,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100852546] [2025-01-09 05:16:08,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:08,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:08,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:08,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:08,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:16:08,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 05:16:08,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 05:16:08,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:08,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:08,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:16:08,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:16:08,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:08,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100852546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:08,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:16:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974135771] [2025-01-09 05:16:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:08,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:08,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:08,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:08,482 INFO L87 Difference]: Start difference. First operand 4337 states and 7048 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 05:16:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:08,722 INFO L93 Difference]: Finished difference Result 8605 states and 13041 transitions. [2025-01-09 05:16:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 116 [2025-01-09 05:16:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:08,773 INFO L225 Difference]: With dead ends: 8605 [2025-01-09 05:16:08,774 INFO L226 Difference]: Without dead ends: 6403 [2025-01-09 05:16:08,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:08,786 INFO L435 NwaCegarLoop]: 4127 mSDtfsCounter, 4037 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4037 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:08,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4037 Valid, 4256 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2025-01-09 05:16:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6371. [2025-01-09 05:16:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6371 states, 5480 states have (on average 1.5556569343065694) internal successors, (8525), 5598 states have internal predecessors, (8525), 475 states have call successors, (475), 311 states have call predecessors, (475), 414 states have return successors, (816), 477 states have call predecessors, (816), 473 states have call successors, (816) [2025-01-09 05:16:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6371 states to 6371 states and 9816 transitions. [2025-01-09 05:16:09,104 INFO L78 Accepts]: Start accepts. Automaton has 6371 states and 9816 transitions. Word has length 116 [2025-01-09 05:16:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:09,106 INFO L471 AbstractCegarLoop]: Abstraction has 6371 states and 9816 transitions. [2025-01-09 05:16:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 05:16:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6371 states and 9816 transitions. [2025-01-09 05:16:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 05:16:09,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:09,121 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:09,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:16:09,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:09,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:09,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash 347162411, now seen corresponding path program 1 times [2025-01-09 05:16:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095100210] [2025-01-09 05:16:09,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:09,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 05:16:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 05:16:09,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:09,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 05:16:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:09,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095100210] [2025-01-09 05:16:09,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095100210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:09,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424692654] [2025-01-09 05:16:09,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:09,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:09,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:09,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:09,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:16:09,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 05:16:09,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 05:16:09,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:09,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:09,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:16:09,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 05:16:09,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424692654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:09,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:09,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:16:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139630843] [2025-01-09 05:16:09,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:09,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:09,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:09,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:09,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:09,611 INFO L87 Difference]: Start difference. First operand 6371 states and 9816 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 05:16:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:09,833 INFO L93 Difference]: Finished difference Result 9658 states and 14346 transitions. [2025-01-09 05:16:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:09,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 131 [2025-01-09 05:16:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:09,864 INFO L225 Difference]: With dead ends: 9658 [2025-01-09 05:16:09,865 INFO L226 Difference]: Without dead ends: 6699 [2025-01-09 05:16:09,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:09,877 INFO L435 NwaCegarLoop]: 4131 mSDtfsCounter, 4058 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:09,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4058 Valid, 4268 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2025-01-09 05:16:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 6661. [2025-01-09 05:16:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 5738 states have (on average 1.528232833739979) internal successors, (8769), 5856 states have internal predecessors, (8769), 481 states have call successors, (481), 337 states have call predecessors, (481), 440 states have return successors, (848), 483 states have call predecessors, (848), 479 states have call successors, (848) [2025-01-09 05:16:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 10098 transitions. [2025-01-09 05:16:10,167 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 10098 transitions. Word has length 131 [2025-01-09 05:16:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:10,168 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 10098 transitions. [2025-01-09 05:16:10,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 05:16:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 10098 transitions. [2025-01-09 05:16:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:16:10,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:10,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:10,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:16:10,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:10,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:10,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash 993673222, now seen corresponding path program 1 times [2025-01-09 05:16:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511843582] [2025-01-09 05:16:10,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:10,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:16:10,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:16:10,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:10,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 05:16:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:10,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511843582] [2025-01-09 05:16:10,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511843582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773619598] [2025-01-09 05:16:10,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:10,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:10,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:16:10,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:16:10,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:16:10,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:10,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:10,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:16:10,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 05:16:10,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:10,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773619598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:10,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:10,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:16:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623776702] [2025-01-09 05:16:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:10,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:10,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:10,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:10,639 INFO L87 Difference]: Start difference. First operand 6661 states and 10098 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 05:16:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:10,968 INFO L93 Difference]: Finished difference Result 15381 states and 22060 transitions. [2025-01-09 05:16:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:10,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 132 [2025-01-09 05:16:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:11,020 INFO L225 Difference]: With dead ends: 15381 [2025-01-09 05:16:11,021 INFO L226 Difference]: Without dead ends: 10857 [2025-01-09 05:16:11,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:11,042 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 124 mSDsluCounter, 4104 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 8325 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:11,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 8325 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10857 states. [2025-01-09 05:16:11,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10857 to 10841. [2025-01-09 05:16:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10841 states, 9048 states have (on average 1.4417550839964632) internal successors, (13045), 9282 states have internal predecessors, (13045), 927 states have call successors, (927), 657 states have call predecessors, (927), 864 states have return successors, (1806), 933 states have call predecessors, (1806), 925 states have call successors, (1806) [2025-01-09 05:16:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10841 states to 10841 states and 15778 transitions. [2025-01-09 05:16:11,625 INFO L78 Accepts]: Start accepts. Automaton has 10841 states and 15778 transitions. Word has length 132 [2025-01-09 05:16:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:11,627 INFO L471 AbstractCegarLoop]: Abstraction has 10841 states and 15778 transitions. [2025-01-09 05:16:11,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 05:16:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 10841 states and 15778 transitions. [2025-01-09 05:16:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:16:11,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:11,652 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:11,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:16:11,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 05:16:11,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:11,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1277059506, now seen corresponding path program 1 times [2025-01-09 05:16:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939917175] [2025-01-09 05:16:11,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:11,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:11,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:16:11,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:16:11,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:11,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 05:16:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939917175] [2025-01-09 05:16:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939917175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394340985] [2025-01-09 05:16:11,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:11,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:11,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:11,938 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:11,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:16:11,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:16:12,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:16:12,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:12,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:16:12,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:16:12,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394340985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:12,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:12,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:16:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386019589] [2025-01-09 05:16:12,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:12,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:12,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:12,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:12,090 INFO L87 Difference]: Start difference. First operand 10841 states and 15778 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 05:16:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:12,642 INFO L93 Difference]: Finished difference Result 15339 states and 22206 transitions. [2025-01-09 05:16:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:12,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 133 [2025-01-09 05:16:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:12,703 INFO L225 Difference]: With dead ends: 15339 [2025-01-09 05:16:12,704 INFO L226 Difference]: Without dead ends: 10861 [2025-01-09 05:16:12,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:12,726 INFO L435 NwaCegarLoop]: 4187 mSDtfsCounter, 109 mSDsluCounter, 4096 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 8283 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:12,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 8283 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2025-01-09 05:16:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10817. [2025-01-09 05:16:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10817 states, 9024 states have (on average 1.428302304964539) internal successors, (12889), 9258 states have internal predecessors, (12889), 927 states have call successors, (927), 657 states have call predecessors, (927), 864 states have return successors, (1806), 933 states have call predecessors, (1806), 925 states have call successors, (1806) [2025-01-09 05:16:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10817 states to 10817 states and 15622 transitions. [2025-01-09 05:16:13,309 INFO L78 Accepts]: Start accepts. Automaton has 10817 states and 15622 transitions. Word has length 133 [2025-01-09 05:16:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:13,310 INFO L471 AbstractCegarLoop]: Abstraction has 10817 states and 15622 transitions. [2025-01-09 05:16:13,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 05:16:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10817 states and 15622 transitions. [2025-01-09 05:16:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:16:13,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:13,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:13,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 05:16:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 05:16:13,540 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:13,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1071421744, now seen corresponding path program 1 times [2025-01-09 05:16:13,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:13,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332163597] [2025-01-09 05:16:13,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:13,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:13,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:16:13,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:16:13,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:13,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 05:16:13,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:13,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332163597] [2025-01-09 05:16:13,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332163597] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:13,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180562826] [2025-01-09 05:16:13,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:13,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:13,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:13,625 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:13,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:16:13,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:16:13,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:16:13,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:13,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:13,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:16:13,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 05:16:13,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:13,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180562826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:13,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:13,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:16:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368322697] [2025-01-09 05:16:13,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:13,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:13,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:13,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:13,756 INFO L87 Difference]: Start difference. First operand 10817 states and 15622 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 05:16:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:14,082 INFO L93 Difference]: Finished difference Result 17187 states and 24470 transitions. [2025-01-09 05:16:14,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:14,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 133 [2025-01-09 05:16:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:14,129 INFO L225 Difference]: With dead ends: 17187 [2025-01-09 05:16:14,129 INFO L226 Difference]: Without dead ends: 9531 [2025-01-09 05:16:14,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:14,157 INFO L435 NwaCegarLoop]: 4109 mSDtfsCounter, 4085 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4085 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:14,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4085 Valid, 4133 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9531 states. [2025-01-09 05:16:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9531 to 9099. [2025-01-09 05:16:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9099 states, 7712 states have (on average 1.415067427385892) internal successors, (10913), 7834 states have internal predecessors, (10913), 755 states have call successors, (755), 535 states have call predecessors, (755), 630 states have return successors, (1162), 745 states have call predecessors, (1162), 753 states have call successors, (1162) [2025-01-09 05:16:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9099 states to 9099 states and 12830 transitions. [2025-01-09 05:16:14,611 INFO L78 Accepts]: Start accepts. Automaton has 9099 states and 12830 transitions. Word has length 133 [2025-01-09 05:16:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:14,611 INFO L471 AbstractCegarLoop]: Abstraction has 9099 states and 12830 transitions. [2025-01-09 05:16:14,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 05:16:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9099 states and 12830 transitions. [2025-01-09 05:16:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 05:16:14,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:14,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:14,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 05:16:14,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 05:16:14,826 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:14,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1208120095, now seen corresponding path program 1 times [2025-01-09 05:16:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:14,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196475087] [2025-01-09 05:16:14,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:14,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:14,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:16:14,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:16:14,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:14,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 05:16:14,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:14,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196475087] [2025-01-09 05:16:14,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196475087] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:14,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812708461] [2025-01-09 05:16:14,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:14,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:14,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:14,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:14,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:16:14,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:16:15,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:16:15,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:15,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:15,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 05:16:15,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 05:16:15,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:15,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812708461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:15,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:15,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-09 05:16:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560012599] [2025-01-09 05:16:15,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:15,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:15,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:15,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:15,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:16:15,119 INFO L87 Difference]: Start difference. First operand 9099 states and 12830 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 05:16:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:15,502 INFO L93 Difference]: Finished difference Result 11791 states and 16389 transitions. [2025-01-09 05:16:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:16:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 134 [2025-01-09 05:16:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:15,536 INFO L225 Difference]: With dead ends: 11791 [2025-01-09 05:16:15,536 INFO L226 Difference]: Without dead ends: 7245 [2025-01-09 05:16:15,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:15,550 INFO L435 NwaCegarLoop]: 4055 mSDtfsCounter, 4104 mSDsluCounter, 8065 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 12120 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:15,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 12120 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:16:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7245 states. [2025-01-09 05:16:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7245 to 7221. [2025-01-09 05:16:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7221 states, 6224 states have (on average 1.4371786632390746) internal successors, (8945), 6278 states have internal predecessors, (8945), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2025-01-09 05:16:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7221 states to 7221 states and 10278 transitions. [2025-01-09 05:16:15,952 INFO L78 Accepts]: Start accepts. Automaton has 7221 states and 10278 transitions. Word has length 134 [2025-01-09 05:16:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:15,952 INFO L471 AbstractCegarLoop]: Abstraction has 7221 states and 10278 transitions. [2025-01-09 05:16:15,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 05:16:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7221 states and 10278 transitions. [2025-01-09 05:16:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 05:16:15,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:15,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:15,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 05:16:16,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:16,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:16,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2055806303, now seen corresponding path program 1 times [2025-01-09 05:16:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645902339] [2025-01-09 05:16:16,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:16,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:16:16,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:16:16,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:16,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 05:16:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:16,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645902339] [2025-01-09 05:16:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645902339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:16,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971737683] [2025-01-09 05:16:16,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:16,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:16,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:16,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:16,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 05:16:16,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:16:16,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:16:16,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:16,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:16,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 05:16:16,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 05:16:16,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:16,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971737683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:16,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:16,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-09 05:16:16,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537397972] [2025-01-09 05:16:16,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:16,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:16,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:16,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:16:16,430 INFO L87 Difference]: Start difference. First operand 7221 states and 10278 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 05:16:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:16,840 INFO L93 Difference]: Finished difference Result 11389 states and 15654 transitions. [2025-01-09 05:16:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:16:16,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 134 [2025-01-09 05:16:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:16,877 INFO L225 Difference]: With dead ends: 11389 [2025-01-09 05:16:16,877 INFO L226 Difference]: Without dead ends: 6869 [2025-01-09 05:16:16,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:16:16,892 INFO L435 NwaCegarLoop]: 4053 mSDtfsCounter, 4142 mSDsluCounter, 8060 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4151 SdHoareTripleChecker+Valid, 12113 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:16,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4151 Valid, 12113 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:16:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2025-01-09 05:16:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 5167. [2025-01-09 05:16:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5167 states, 4590 states have (on average 1.489760348583878) internal successors, (6838), 4620 states have internal predecessors, (6838), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2025-01-09 05:16:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 7608 transitions. [2025-01-09 05:16:17,204 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 7608 transitions. Word has length 134 [2025-01-09 05:16:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:17,205 INFO L471 AbstractCegarLoop]: Abstraction has 5167 states and 7608 transitions. [2025-01-09 05:16:17,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 05:16:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 7608 transitions. [2025-01-09 05:16:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 05:16:17,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:17,210 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:17,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 05:16:17,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:17,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:17,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash 332757727, now seen corresponding path program 1 times [2025-01-09 05:16:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:17,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5635708] [2025-01-09 05:16:17,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:17,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:16:17,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:16:17,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:17,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 05:16:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5635708] [2025-01-09 05:16:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5635708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475998810] [2025-01-09 05:16:17,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:17,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:17,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:17,516 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:17,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 05:16:17,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:16:17,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:16:17,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:17,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:17,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 05:16:17,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:16:17,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:16:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-09 05:16:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475998810] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:17,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:16:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-01-09 05:16:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577360539] [2025-01-09 05:16:17,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:17,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:16:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:17,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:16:17,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:16:17,831 INFO L87 Difference]: Start difference. First operand 5167 states and 7608 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 05:16:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:18,425 INFO L93 Difference]: Finished difference Result 8984 states and 12128 transitions. [2025-01-09 05:16:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:16:18,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 134 [2025-01-09 05:16:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:18,462 INFO L225 Difference]: With dead ends: 8984 [2025-01-09 05:16:18,463 INFO L226 Difference]: Without dead ends: 7532 [2025-01-09 05:16:18,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:16:18,472 INFO L435 NwaCegarLoop]: 4199 mSDtfsCounter, 4178 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 8350 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:18,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 8350 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:16:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7532 states. [2025-01-09 05:16:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7532 to 6278. [2025-01-09 05:16:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6278 states, 5493 states have (on average 1.4296377207354816) internal successors, (7853), 5527 states have internal predecessors, (7853), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2025-01-09 05:16:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 8901 transitions. [2025-01-09 05:16:18,925 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 8901 transitions. Word has length 134 [2025-01-09 05:16:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:18,926 INFO L471 AbstractCegarLoop]: Abstraction has 6278 states and 8901 transitions. [2025-01-09 05:16:18,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 05:16:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 8901 transitions. [2025-01-09 05:16:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 05:16:18,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:18,931 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:18,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 05:16:19,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:19,135 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:19,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2051023559, now seen corresponding path program 1 times [2025-01-09 05:16:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:19,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172423773] [2025-01-09 05:16:19,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:19,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 05:16:19,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 05:16:19,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:19,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 05:16:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172423773] [2025-01-09 05:16:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172423773] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893074286] [2025-01-09 05:16:19,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:19,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:19,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:19,220 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:19,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 05:16:19,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 05:16:19,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 05:16:19,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:19,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:19,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:16:19,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 05:16:19,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893074286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:19,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:19,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:16:19,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68633888] [2025-01-09 05:16:19,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:19,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:19,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:19,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:19,340 INFO L87 Difference]: Start difference. First operand 6278 states and 8901 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 05:16:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:19,575 INFO L93 Difference]: Finished difference Result 8277 states and 11278 transitions. [2025-01-09 05:16:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:19,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 138 [2025-01-09 05:16:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:19,606 INFO L225 Difference]: With dead ends: 8277 [2025-01-09 05:16:19,607 INFO L226 Difference]: Without dead ends: 6282 [2025-01-09 05:16:19,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:19,618 INFO L435 NwaCegarLoop]: 4101 mSDtfsCounter, 0 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8191 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:19,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8191 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2025-01-09 05:16:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6282. [2025-01-09 05:16:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6282 states, 5497 states have (on average 1.4293250864107696) internal successors, (7857), 5531 states have internal predecessors, (7857), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2025-01-09 05:16:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 8905 transitions. [2025-01-09 05:16:19,971 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 8905 transitions. Word has length 138 [2025-01-09 05:16:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:19,971 INFO L471 AbstractCegarLoop]: Abstraction has 6282 states and 8905 transitions. [2025-01-09 05:16:19,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 05:16:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 8905 transitions. [2025-01-09 05:16:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 05:16:19,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:19,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:19,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 05:16:20,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 05:16:20,182 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash 386466797, now seen corresponding path program 1 times [2025-01-09 05:16:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996121640] [2025-01-09 05:16:20,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:20,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 05:16:20,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 05:16:20,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:20,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 05:16:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996121640] [2025-01-09 05:16:20,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996121640] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110101917] [2025-01-09 05:16:20,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:20,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:20,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:20,258 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:20,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 05:16:20,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 05:16:20,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 05:16:20,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:20,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:20,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 05:16:20,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 05:16:20,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110101917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:20,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 05:16:20,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465646659] [2025-01-09 05:16:20,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:20,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:20,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:20,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:20,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:16:20,383 INFO L87 Difference]: Start difference. First operand 6282 states and 8905 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 05:16:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:20,580 INFO L93 Difference]: Finished difference Result 8360 states and 11419 transitions. [2025-01-09 05:16:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:16:20,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 139 [2025-01-09 05:16:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:20,603 INFO L225 Difference]: With dead ends: 8360 [2025-01-09 05:16:20,603 INFO L226 Difference]: Without dead ends: 4904 [2025-01-09 05:16:20,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:16:20,613 INFO L435 NwaCegarLoop]: 4099 mSDtfsCounter, 0 mSDsluCounter, 12291 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16390 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:20,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16390 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2025-01-09 05:16:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4904. [2025-01-09 05:16:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4904 states, 4367 states have (on average 1.487291046485001) internal successors, (6495), 4393 states have internal predecessors, (6495), 307 states have call successors, (307), 205 states have call predecessors, (307), 228 states have return successors, (361), 309 states have call predecessors, (361), 305 states have call successors, (361) [2025-01-09 05:16:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 7163 transitions. [2025-01-09 05:16:20,819 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 7163 transitions. Word has length 139 [2025-01-09 05:16:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:20,820 INFO L471 AbstractCegarLoop]: Abstraction has 4904 states and 7163 transitions. [2025-01-09 05:16:20,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 05:16:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 7163 transitions. [2025-01-09 05:16:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 05:16:20,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:20,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:20,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 05:16:21,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 05:16:21,029 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:21,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash 734085617, now seen corresponding path program 1 times [2025-01-09 05:16:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:21,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228486635] [2025-01-09 05:16:21,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:21,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 05:16:21,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 05:16:21,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:21,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 05:16:21,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228486635] [2025-01-09 05:16:21,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228486635] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:16:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214410843] [2025-01-09 05:16:21,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:21,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:16:21,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:21,100 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:16:21,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 05:16:21,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 05:16:21,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 05:16:21,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:21,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:21,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 05:16:21,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:16:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 05:16:21,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:16:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214410843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:21,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:16:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-01-09 05:16:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296022399] [2025-01-09 05:16:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:21,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:21,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:21,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:21,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:16:21,204 INFO L87 Difference]: Start difference. First operand 4904 states and 7163 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 05:16:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:21,362 INFO L93 Difference]: Finished difference Result 6572 states and 9111 transitions. [2025-01-09 05:16:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:16:21,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 139 [2025-01-09 05:16:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:21,377 INFO L225 Difference]: With dead ends: 6572 [2025-01-09 05:16:21,377 INFO L226 Difference]: Without dead ends: 2900 [2025-01-09 05:16:21,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:16:21,385 INFO L435 NwaCegarLoop]: 4097 mSDtfsCounter, 0 mSDsluCounter, 12285 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16382 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:21,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16382 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2025-01-09 05:16:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2900. [2025-01-09 05:16:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2753 states have (on average 1.6919723937522702) internal successors, (4658), 2761 states have internal predecessors, (4658), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2025-01-09 05:16:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4829 transitions. [2025-01-09 05:16:21,461 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4829 transitions. Word has length 139 [2025-01-09 05:16:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:21,462 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 4829 transitions. [2025-01-09 05:16:21,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 05:16:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4829 transitions. [2025-01-09 05:16:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 05:16:21,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:21,464 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:21,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 05:16:21,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 05:16:21,665 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:21,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -952677199, now seen corresponding path program 1 times [2025-01-09 05:16:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:21,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61267185] [2025-01-09 05:16:21,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:21,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:21,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 05:16:21,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 05:16:21,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:21,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 05:16:21,687 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 05:16:21,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 05:16:21,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 05:16:21,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:21,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 05:16:21,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 05:16:21,763 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 05:16:21,764 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-01-09 05:16:21,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 05:16:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:16:21,770 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:21,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 05:16:21,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 05:16:21 BoogieIcfgContainer [2025-01-09 05:16:21,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 05:16:21,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 05:16:21,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 05:16:21,887 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 05:16:21,888 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:16:02" (3/4) ... [2025-01-09 05:16:21,889 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 05:16:22,034 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 102. [2025-01-09 05:16:22,125 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 05:16:22,125 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 05:16:22,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 05:16:22,126 INFO L158 Benchmark]: Toolchain (without parser) took 31364.28ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 98.4MB in the beginning and 661.7MB in the end (delta: -563.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-01-09 05:16:22,127 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 05:16:22,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2560.08ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 98.4MB in the beginning and 172.0MB in the end (delta: -73.6MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. [2025-01-09 05:16:22,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 460.33ms. Allocated memory is still 285.2MB. Free memory was 172.0MB in the beginning and 96.0MB in the end (delta: 76.0MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 05:16:22,127 INFO L158 Benchmark]: Boogie Preprocessor took 688.15ms. Allocated memory is still 285.2MB. Free memory was 96.0MB in the beginning and 114.2MB in the end (delta: -18.1MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2025-01-09 05:16:22,128 INFO L158 Benchmark]: RCFGBuilder took 8401.84ms. Allocated memory was 285.2MB in the beginning and 637.5MB in the end (delta: 352.3MB). Free memory was 114.2MB in the beginning and 239.2MB in the end (delta: -125.1MB). Peak memory consumption was 395.7MB. Max. memory is 16.1GB. [2025-01-09 05:16:22,128 INFO L158 Benchmark]: TraceAbstraction took 19008.24ms. Allocated memory was 637.5MB in the beginning and 1.8GB in the end (delta: 1.1GB). Free memory was 239.2MB in the beginning and 686.4MB in the end (delta: -447.2MB). Peak memory consumption was 697.4MB. Max. memory is 16.1GB. [2025-01-09 05:16:22,128 INFO L158 Benchmark]: Witness Printer took 238.50ms. Allocated memory is still 1.8GB. Free memory was 686.4MB in the beginning and 661.7MB in the end (delta: 24.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 05:16:22,129 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2560.08ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 98.4MB in the beginning and 172.0MB in the end (delta: -73.6MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 460.33ms. Allocated memory is still 285.2MB. Free memory was 172.0MB in the beginning and 96.0MB in the end (delta: 76.0MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 688.15ms. Allocated memory is still 285.2MB. Free memory was 96.0MB in the beginning and 114.2MB in the end (delta: -18.1MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * RCFGBuilder took 8401.84ms. Allocated memory was 285.2MB in the beginning and 637.5MB in the end (delta: 352.3MB). Free memory was 114.2MB in the beginning and 239.2MB in the end (delta: -125.1MB). Peak memory consumption was 395.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19008.24ms. Allocated memory was 637.5MB in the beginning and 1.8GB in the end (delta: 1.1GB). Free memory was 239.2MB in the beginning and 686.4MB in the end (delta: -447.2MB). Peak memory consumption was 697.4MB. Max. memory is 16.1GB. * Witness Printer took 238.50ms. Allocated memory is still 1.8GB. Free memory was 686.4MB in the beginning and 661.7MB in the end (delta: 24.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11049]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2296 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46007 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45953 mSDsluCounter, 181597 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111195 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1857 IncrementalHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 70402 mSDtfsCounter, 1857 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 1696 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10841occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 3736 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3525 NumberOfCodeBlocks, 3525 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3490 ConstructedInterpolants, 0 QuantifiedInterpolants, 4525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5018 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 1569/1830 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 05:16:22,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE