./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:50:36,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:50:36,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:50:36,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:50:36,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:50:36,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:50:36,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:50:36,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:50:36,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:50:36,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:50:36,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:50:36,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:50:36,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:50:36,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:50:36,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:50:36,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:50:36,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:50:36,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:50:36,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:50:36,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:50:36,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:50:36,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:50:36,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:50:36,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:50:36,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:50:36,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:50:36,682 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/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 -> b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 [2025-03-08 06:50:36,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:50:36,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:50:36,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:50:36,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:50:36,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:50:36,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2025-03-08 06:50:38,122 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20923cc2e/2d9432ab665a49f3b96db70ff4cbb4c9/FLAGb56f774ce [2025-03-08 06:50:38,690 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:50:38,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2025-03-08 06:50:38,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20923cc2e/2d9432ab665a49f3b96db70ff4cbb4c9/FLAGb56f774ce [2025-03-08 06:50:38,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20923cc2e/2d9432ab665a49f3b96db70ff4cbb4c9 [2025-03-08 06:50:38,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:50:38,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:50:38,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:50:38,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:50:38,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:50:38,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:50:38" (1/1) ... [2025-03-08 06:50:38,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:38, skipping insertion in model container [2025-03-08 06:50:38,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:50:38" (1/1) ... [2025-03-08 06:50:38,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:50:39,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2025-03-08 06:50:39,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2025-03-08 06:50:40,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:50:40,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:50:40,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2025-03-08 06:50:40,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2025-03-08 06:50:40,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:50:40,774 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:50:40,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40 WrapperNode [2025-03-08 06:50:40,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:50:40,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:50:40,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:50:40,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:50:40,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:40,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,108 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12564 [2025-03-08 06:50:41,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:50:41,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:50:41,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:50:41,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:50:41,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,319 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-03-08 06:50:41,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,451 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:50:41,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:50:41,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:50:41,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:50:41,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (1/1) ... [2025-03-08 06:50:41,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:50:41,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:41,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:50:41,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:50:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:50:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:50:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:50:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:50:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:50:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:50:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:50:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:50:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:50:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:50:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:50:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:50:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:50:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:50:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:50:41,610 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:50:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:50:41,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:50:41,681 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:50:41,683 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:50:47,639 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:50:47,640 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:50:47,641 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:50:47,641 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:50:47,641 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:50:47,641 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:50:47,643 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:50:47,847 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2025-03-08 06:50:47,847 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:50:47,892 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:50:47,892 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:50:47,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:47 BoogieIcfgContainer [2025-03-08 06:50:47,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:50:47,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:50:47,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:50:47,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:50:47,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:50:38" (1/3) ... [2025-03-08 06:50:47,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8825185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:50:47, skipping insertion in model container [2025-03-08 06:50:47,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:40" (2/3) ... [2025-03-08 06:50:47,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8825185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:50:47, skipping insertion in model container [2025-03-08 06:50:47,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:47" (3/3) ... [2025-03-08 06:50:47,901 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.01.cil-2.c [2025-03-08 06:50:47,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:50:47,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.01.cil-2.c that has 8 procedures, 2296 locations, 1 initial locations, 5 loop locations, and 2 error locations. [2025-03-08 06:50:48,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:50:48,041 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;@73ad2b7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:50:48,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:50:48,054 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-03-08 06:50:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:50:48,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:48,063 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-03-08 06:50:48,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:48,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:48,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1823629984, now seen corresponding path program 1 times [2025-03-08 06:50:48,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337796668] [2025-03-08 06:50:48,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:48,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:48,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:50:48,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:50:48,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:48,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:48,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:48,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337796668] [2025-03-08 06:50:48,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337796668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:48,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:48,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:48,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995898116] [2025-03-08 06:50:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:48,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:48,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:48,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:48,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:48,362 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-03-08 06:50:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:48,714 INFO L93 Difference]: Finished difference Result 4687 states and 8645 transitions. [2025-03-08 06:50:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:50:48,716 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-03-08 06:50:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:48,732 INFO L225 Difference]: With dead ends: 4687 [2025-03-08 06:50:48,732 INFO L226 Difference]: Without dead ends: 2330 [2025-03-08 06:50:48,739 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-03-08 06:50:48,741 INFO L435 NwaCegarLoop]: 4154 mSDtfsCounter, 4253 mSDsluCounter, 8354 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4262 SdHoareTripleChecker+Valid, 12508 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:48,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4262 Valid, 12508 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-03-08 06:50:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2321. [2025-03-08 06:50:48,841 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-03-08 06:50:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4246 transitions. [2025-03-08 06:50:48,857 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4246 transitions. Word has length 56 [2025-03-08 06:50:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:48,858 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4246 transitions. [2025-03-08 06:50:48,858 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-03-08 06:50:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4246 transitions. [2025-03-08 06:50:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:50:48,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:48,860 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-03-08 06:50:48,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:50:48,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:48,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:48,861 INFO L85 PathProgramCache]: Analyzing trace with hash -591412898, now seen corresponding path program 1 times [2025-03-08 06:50:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:48,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6116682] [2025-03-08 06:50:48,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:48,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:50:48,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:50:48,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:48,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:49,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:49,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6116682] [2025-03-08 06:50:49,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6116682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:49,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:49,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245789347] [2025-03-08 06:50:49,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:49,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:49,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:49,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:49,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:49,010 INFO L87 Difference]: Start difference. First operand 2321 states and 4246 transitions. Second operand has 5 states, 5 states have (on average 9.0) 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-03-08 06:50:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:49,267 INFO L93 Difference]: Finished difference Result 2524 states and 4543 transitions. [2025-03-08 06:50:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:49,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) 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-03-08 06:50:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:49,288 INFO L225 Difference]: With dead ends: 2524 [2025-03-08 06:50:49,288 INFO L226 Difference]: Without dead ends: 2333 [2025-03-08 06:50:49,290 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-03-08 06:50:49,291 INFO L435 NwaCegarLoop]: 4066 mSDtfsCounter, 4133 mSDsluCounter, 8083 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4142 SdHoareTripleChecker+Valid, 12149 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:49,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4142 Valid, 12149 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:50:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2025-03-08 06:50:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2321. [2025-03-08 06:50:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2279 states have (on average 1.838964458095656) internal successors, (4191), 2283 states have internal predecessors, (4191), 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-03-08 06:50:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4244 transitions. [2025-03-08 06:50:49,379 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4244 transitions. Word has length 56 [2025-03-08 06:50:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:49,379 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4244 transitions. [2025-03-08 06:50:49,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) 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-03-08 06:50:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4244 transitions. [2025-03-08 06:50:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:50:49,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:49,383 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-03-08 06:50:49,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:50:49,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:49,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1040109537, now seen corresponding path program 1 times [2025-03-08 06:50:49,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:49,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231577539] [2025-03-08 06:50:49,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:49,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:49,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:50:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:50:49,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:49,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231577539] [2025-03-08 06:50:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231577539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:49,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808249089] [2025-03-08 06:50:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:49,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:49,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:49,608 INFO L87 Difference]: Start difference. First operand 2321 states and 4244 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-03-08 06:50:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:49,975 INFO L93 Difference]: Finished difference Result 2632 states and 4686 transitions. [2025-03-08 06:50:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:49,976 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-03-08 06:50:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:49,988 INFO L225 Difference]: With dead ends: 2632 [2025-03-08 06:50:49,989 INFO L226 Difference]: Without dead ends: 2441 [2025-03-08 06:50:49,990 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-03-08 06:50:49,992 INFO L435 NwaCegarLoop]: 4143 mSDtfsCounter, 4209 mSDsluCounter, 12379 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4220 SdHoareTripleChecker+Valid, 16522 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:49,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4220 Valid, 16522 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2025-03-08 06:50:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2405. [2025-03-08 06:50:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2347 states have (on average 1.8274392841925864) internal successors, (4289), 2352 states have internal predecessors, (4289), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-03-08 06:50:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 4363 transitions. [2025-03-08 06:50:50,062 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 4363 transitions. Word has length 56 [2025-03-08 06:50:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:50,062 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 4363 transitions. [2025-03-08 06:50:50,063 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-03-08 06:50:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 4363 transitions. [2025-03-08 06:50:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:50:50,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:50,065 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-03-08 06:50:50,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:50:50,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:50,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -916036290, now seen corresponding path program 1 times [2025-03-08 06:50:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:50,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443562978] [2025-03-08 06:50:50,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:50,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:50:50,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:50:50,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:50,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443562978] [2025-03-08 06:50:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443562978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972536827] [2025-03-08 06:50:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:50,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:50,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:50,140 INFO L87 Difference]: Start difference. First operand 2405 states and 4363 transitions. Second operand has 5 states, 5 states have (on average 9.0) 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-03-08 06:50:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:50,302 INFO L93 Difference]: Finished difference Result 2690 states and 4772 transitions. [2025-03-08 06:50:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) 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-03-08 06:50:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:50,311 INFO L225 Difference]: With dead ends: 2690 [2025-03-08 06:50:50,311 INFO L226 Difference]: Without dead ends: 2415 [2025-03-08 06:50:50,313 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-03-08 06:50:50,313 INFO L435 NwaCegarLoop]: 4061 mSDtfsCounter, 4127 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12133 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:50,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 12133 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:50:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2025-03-08 06:50:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2405. [2025-03-08 06:50:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2347 states have (on average 1.8261610566680868) internal successors, (4286), 2352 states have internal predecessors, (4286), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-03-08 06:50:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 4360 transitions. [2025-03-08 06:50:50,372 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 4360 transitions. Word has length 56 [2025-03-08 06:50:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:50,373 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 4360 transitions. [2025-03-08 06:50:50,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) 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-03-08 06:50:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 4360 transitions. [2025-03-08 06:50:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:50:50,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:50,375 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-03-08 06:50:50,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:50:50,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:50,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1443270719, now seen corresponding path program 1 times [2025-03-08 06:50:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:50,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381379081] [2025-03-08 06:50:50,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:50,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:50:50,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:50:50,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:50,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:50:50,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:50,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381379081] [2025-03-08 06:50:50,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381379081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:50,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:50,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:50:50,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877873716] [2025-03-08 06:50:50,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:50,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:50:50,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:50,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:50:50,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:50:50,433 INFO L87 Difference]: Start difference. First operand 2405 states and 4360 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-03-08 06:50:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:50,551 INFO L93 Difference]: Finished difference Result 2921 states and 5102 transitions. [2025-03-08 06:50:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:50,552 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-03-08 06:50:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:50,561 INFO L225 Difference]: With dead ends: 2921 [2025-03-08 06:50:50,561 INFO L226 Difference]: Without dead ends: 2647 [2025-03-08 06:50:50,563 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-03-08 06:50:50,564 INFO L435 NwaCegarLoop]: 4215 mSDtfsCounter, 4196 mSDsluCounter, 4158 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 8373 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-03-08 06:50:50,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4196 Valid, 8373 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:50:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2025-03-08 06:50:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2644. [2025-03-08 06:50:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2536 states have (on average 1.788249211356467) internal successors, (4535), 2546 states have internal predecessors, (4535), 66 states have call successors, (66), 37 states have call predecessors, (66), 40 states have return successors, (71), 62 states have call predecessors, (71), 64 states have call successors, (71) [2025-03-08 06:50:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 4672 transitions. [2025-03-08 06:50:50,679 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 4672 transitions. Word has length 56 [2025-03-08 06:50:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:50,679 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 4672 transitions. [2025-03-08 06:50:50,680 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-03-08 06:50:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 4672 transitions. [2025-03-08 06:50:50,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:50:50,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:50,681 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-03-08 06:50:50,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:50:50,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:50,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash 857078616, now seen corresponding path program 1 times [2025-03-08 06:50:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:50,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384494282] [2025-03-08 06:50:50,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:50,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:50,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:50:50,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:50:50,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:50,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:50:50,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384494282] [2025-03-08 06:50:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384494282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806918183] [2025-03-08 06:50:50,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:50,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:50,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:50,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:50,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:50:50,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:50:50,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:50:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:50,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:50,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:50:50,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:50:50,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806918183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:50,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:50,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:50:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608241529] [2025-03-08 06:50:50,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:50,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:50:50,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:50,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:50:50,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:50,911 INFO L87 Difference]: Start difference. First operand 2644 states and 4672 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:50:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:50,977 INFO L93 Difference]: Finished difference Result 3645 states and 6054 transitions. [2025-03-08 06:50:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:50:50,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2025-03-08 06:50:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:50,987 INFO L225 Difference]: With dead ends: 3645 [2025-03-08 06:50:50,988 INFO L226 Difference]: Without dead ends: 3132 [2025-03-08 06:50:50,989 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-03-08 06:50:50,990 INFO L435 NwaCegarLoop]: 4105 mSDtfsCounter, 4073 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4073 SdHoareTripleChecker+Valid, 4232 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-03-08 06:50:50,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4073 Valid, 4232 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:50:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2025-03-08 06:50:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3122. [2025-03-08 06:50:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2918 states have (on average 1.7333790267306375) internal successors, (5058), 2935 states have internal predecessors, (5058), 122 states have call successors, (122), 73 states have call predecessors, (122), 80 states have return successors, (133), 115 states have call predecessors, (133), 120 states have call successors, (133) [2025-03-08 06:50:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5313 transitions. [2025-03-08 06:50:51,065 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5313 transitions. Word has length 90 [2025-03-08 06:50:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:51,066 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 5313 transitions. [2025-03-08 06:50:51,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:50:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5313 transitions. [2025-03-08 06:50:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:50:51,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:51,067 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-03-08 06:50:51,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:50:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 06:50:51,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1216797842, now seen corresponding path program 1 times [2025-03-08 06:50:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925138714] [2025-03-08 06:50:51,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:51,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:50:51,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:50:51,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:50:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:51,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925138714] [2025-03-08 06:50:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925138714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:51,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207298304] [2025-03-08 06:50:51,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:51,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:51,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:51,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:51,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:50:51,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:50:51,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:50:51,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:51,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:51,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:50:51,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:50:51,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207298304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:50:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945503679] [2025-03-08 06:50:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:51,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:50:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:51,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:50:51,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:51,420 INFO L87 Difference]: Start difference. First operand 3122 states and 5313 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-03-08 06:50:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:51,514 INFO L93 Difference]: Finished difference Result 4971 states and 7863 transitions. [2025-03-08 06:50:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:50:51,515 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-03-08 06:50:51,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:51,533 INFO L225 Difference]: With dead ends: 4971 [2025-03-08 06:50:51,533 INFO L226 Difference]: Without dead ends: 3981 [2025-03-08 06:50:51,537 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-03-08 06:50:51,538 INFO L435 NwaCegarLoop]: 4218 mSDtfsCounter, 111 mSDsluCounter, 4102 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8320 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-03-08 06:50:51,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8320 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:50:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2025-03-08 06:50:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2025-03-08 06:50:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3606 states have (on average 1.6569606211869108) internal successors, (5975), 3632 states have internal predecessors, (5975), 221 states have call successors, (221), 137 states have call predecessors, (221), 152 states have return successors, (270), 215 states have call predecessors, (270), 219 states have call successors, (270) [2025-03-08 06:50:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 6466 transitions. [2025-03-08 06:50:51,740 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 6466 transitions. Word has length 90 [2025-03-08 06:50:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:51,740 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 6466 transitions. [2025-03-08 06:50:51,740 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-03-08 06:50:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 6466 transitions. [2025-03-08 06:50:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 06:50:51,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:51,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:50:51,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:50:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 06:50:51,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:51,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1183890374, now seen corresponding path program 1 times [2025-03-08 06:50:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:51,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116389247] [2025-03-08 06:50:51,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:51,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:50:51,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:50:51,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:51,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 06:50:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116389247] [2025-03-08 06:50:52,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116389247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299219522] [2025-03-08 06:50:52,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:52,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:52,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:52,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:52,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:50:52,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:50:52,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:50:52,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:52,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:52,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:50:52,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 06:50:52,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299219522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:52,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:52,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:50:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871668378] [2025-03-08 06:50:52,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:52,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:50:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:52,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:50:52,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:52,153 INFO L87 Difference]: Start difference. First operand 3981 states and 6466 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-03-08 06:50:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:52,291 INFO L93 Difference]: Finished difference Result 6017 states and 9267 transitions. [2025-03-08 06:50:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:50:52,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 131 [2025-03-08 06:50:52,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:52,311 INFO L225 Difference]: With dead ends: 6017 [2025-03-08 06:50:52,314 INFO L226 Difference]: Without dead ends: 4173 [2025-03-08 06:50:52,320 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-03-08 06:50:52,321 INFO L435 NwaCegarLoop]: 4108 mSDtfsCounter, 4084 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4132 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-03-08 06:50:52,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4084 Valid, 4132 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:50:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2025-03-08 06:50:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4173. [2025-03-08 06:50:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 3778 states have (on average 1.6201694017998942) internal successors, (6121), 3804 states have internal predecessors, (6121), 225 states have call successors, (225), 153 states have call predecessors, (225), 168 states have return successors, (274), 219 states have call predecessors, (274), 223 states have call successors, (274) [2025-03-08 06:50:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 6620 transitions. [2025-03-08 06:50:52,445 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 6620 transitions. Word has length 131 [2025-03-08 06:50:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:52,446 INFO L471 AbstractCegarLoop]: Abstraction has 4173 states and 6620 transitions. [2025-03-08 06:50:52,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-03-08 06:50:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 6620 transitions. [2025-03-08 06:50:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 06:50:52,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:52,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:50:52,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:50:52,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:52,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash 123624886, now seen corresponding path program 1 times [2025-03-08 06:50:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:52,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358071986] [2025-03-08 06:50:52,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:52,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:50:52,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:50:52,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:52,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 06:50:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358071986] [2025-03-08 06:50:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358071986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470493668] [2025-03-08 06:50:52,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:52,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:52,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:52,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:52,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:50:52,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:50:52,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:50:52,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:52,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:52,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:50:52,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 06:50:52,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:52,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470493668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:52,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:52,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:50:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96913956] [2025-03-08 06:50:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:52,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:50:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:52,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:50:52,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:52,905 INFO L87 Difference]: Start difference. First operand 4173 states and 6620 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-03-08 06:50:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:53,058 INFO L93 Difference]: Finished difference Result 5908 states and 8876 transitions. [2025-03-08 06:50:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:50:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-03-08 06:50:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:53,089 INFO L225 Difference]: With dead ends: 5908 [2025-03-08 06:50:53,090 INFO L226 Difference]: Without dead ends: 4293 [2025-03-08 06:50:53,099 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-03-08 06:50:53,103 INFO L435 NwaCegarLoop]: 4125 mSDtfsCounter, 4054 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4054 SdHoareTripleChecker+Valid, 4258 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-03-08 06:50:53,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4054 Valid, 4258 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:50:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2025-03-08 06:50:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 4161. [2025-03-08 06:50:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 3766 states have (on average 1.6125862984599044) internal successors, (6073), 3792 states have internal predecessors, (6073), 225 states have call successors, (225), 153 states have call predecessors, (225), 168 states have return successors, (274), 219 states have call predecessors, (274), 223 states have call successors, (274) [2025-03-08 06:50:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 6572 transitions. [2025-03-08 06:50:53,370 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 6572 transitions. Word has length 131 [2025-03-08 06:50:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:53,371 INFO L471 AbstractCegarLoop]: Abstraction has 4161 states and 6572 transitions. [2025-03-08 06:50:53,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-03-08 06:50:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 6572 transitions. [2025-03-08 06:50:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:50:53,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:53,375 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-03-08 06:50:53,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 06:50:53,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:53,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:53,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2045141427, now seen corresponding path program 1 times [2025-03-08 06:50:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:53,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140043879] [2025-03-08 06:50:53,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:53,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:53,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:50:53,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:50:53,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:53,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 06:50:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140043879] [2025-03-08 06:50:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140043879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286097317] [2025-03-08 06:50:53,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:53,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:53,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:53,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:53,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:50:53,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:50:53,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:50:53,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:53,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:53,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:50:53,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 06:50:53,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286097317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:53,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:50:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401047595] [2025-03-08 06:50:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:53,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:50:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:53,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:50:53,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:53,738 INFO L87 Difference]: Start difference. First operand 4161 states and 6572 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-03-08 06:50:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:53,905 INFO L93 Difference]: Finished difference Result 8061 states and 11638 transitions. [2025-03-08 06:50:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:50:53,905 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-03-08 06:50:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:53,923 INFO L225 Difference]: With dead ends: 8061 [2025-03-08 06:50:53,923 INFO L226 Difference]: Without dead ends: 6037 [2025-03-08 06:50:53,929 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-03-08 06:50:53,930 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 120 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8309 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-03-08 06:50:53,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 8309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:50:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2025-03-08 06:50:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 6033. [2025-03-08 06:50:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6033 states, 5272 states have (on average 1.5077769347496206) internal successors, (7949), 5322 states have internal predecessors, (7949), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-08 06:50:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 8978 transitions. [2025-03-08 06:50:54,108 INFO L78 Accepts]: Start accepts. Automaton has 6033 states and 8978 transitions. Word has length 132 [2025-03-08 06:50:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:54,108 INFO L471 AbstractCegarLoop]: Abstraction has 6033 states and 8978 transitions. [2025-03-08 06:50:54,109 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-03-08 06:50:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6033 states and 8978 transitions. [2025-03-08 06:50:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:50:54,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:54,115 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-03-08 06:50:54,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 06:50:54,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 06:50:54,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:54,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash 231492628, now seen corresponding path program 1 times [2025-03-08 06:50:54,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:54,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727652380] [2025-03-08 06:50:54,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:54,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:54,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:50:54,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:50:54,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:54,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 06:50:54,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727652380] [2025-03-08 06:50:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727652380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561956461] [2025-03-08 06:50:54,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:54,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:54,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:54,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:50:54,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:50:54,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:50:54,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:54,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:54,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:50:54,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:50:54,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561956461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:50:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166241835] [2025-03-08 06:50:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:54,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:50:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:54,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:50:54,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:54,512 INFO L87 Difference]: Start difference. First operand 6033 states and 8978 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:50:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:54,671 INFO L93 Difference]: Finished difference Result 8051 states and 11706 transitions. [2025-03-08 06:50:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:50:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 133 [2025-03-08 06:50:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:54,689 INFO L225 Difference]: With dead ends: 8051 [2025-03-08 06:50:54,690 INFO L226 Difference]: Without dead ends: 6045 [2025-03-08 06:50:54,697 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-03-08 06:50:54,698 INFO L435 NwaCegarLoop]: 4180 mSDtfsCounter, 85 mSDsluCounter, 4092 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 8272 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-03-08 06:50:54,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 8272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:50:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2025-03-08 06:50:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 6025. [2025-03-08 06:50:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 5264 states have (on average 1.4971504559270516) internal successors, (7881), 5314 states have internal predecessors, (7881), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-08 06:50:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8910 transitions. [2025-03-08 06:50:55,004 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8910 transitions. Word has length 133 [2025-03-08 06:50:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:55,011 INFO L471 AbstractCegarLoop]: Abstraction has 6025 states and 8910 transitions. [2025-03-08 06:50:55,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:50:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8910 transitions. [2025-03-08 06:50:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:50:55,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:55,026 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-03-08 06:50:55,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 06:50:55,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:55,230 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:55,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:55,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1177438217, now seen corresponding path program 1 times [2025-03-08 06:50:55,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:55,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803968616] [2025-03-08 06:50:55,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:55,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:50:55,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:50:55,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:55,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:50:55,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:55,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803968616] [2025-03-08 06:50:55,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803968616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:55,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807278292] [2025-03-08 06:50:55,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:55,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:55,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:55,341 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:55,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:50:55,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:50:55,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:50:55,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:55,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:55,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:50:55,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 06:50:55,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807278292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-08 06:50:55,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281750627] [2025-03-08 06:50:55,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:55,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:55,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:55,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:50:55,511 INFO L87 Difference]: Start difference. First operand 6025 states and 8910 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-03-08 06:50:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:55,812 INFO L93 Difference]: Finished difference Result 9905 states and 13917 transitions. [2025-03-08 06:50:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:55,812 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-03-08 06:50:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:55,829 INFO L225 Difference]: With dead ends: 9905 [2025-03-08 06:50:55,829 INFO L226 Difference]: Without dead ends: 6025 [2025-03-08 06:50:55,837 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-03-08 06:50:55,838 INFO L435 NwaCegarLoop]: 4055 mSDtfsCounter, 4104 mSDsluCounter, 8065 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 12120 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:55,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 12120 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:50:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2025-03-08 06:50:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 6025. [2025-03-08 06:50:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 5264 states have (on average 1.4789133738601823) internal successors, (7785), 5314 states have internal predecessors, (7785), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-08 06:50:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8814 transitions. [2025-03-08 06:50:56,085 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8814 transitions. Word has length 134 [2025-03-08 06:50:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:56,085 INFO L471 AbstractCegarLoop]: Abstraction has 6025 states and 8814 transitions. [2025-03-08 06:50:56,085 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-03-08 06:50:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8814 transitions. [2025-03-08 06:50:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:50:56,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:56,092 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-03-08 06:50:56,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 06:50:56,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:56,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:56,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash -661917768, now seen corresponding path program 1 times [2025-03-08 06:50:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348686218] [2025-03-08 06:50:56,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:56,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:56,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:50:56,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:50:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:50:56,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:56,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348686218] [2025-03-08 06:50:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348686218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:56,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69584028] [2025-03-08 06:50:56,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:56,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:56,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:56,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:56,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 06:50:56,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:50:56,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:50:56,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:56,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:56,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:50:56,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 06:50:56,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69584028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-08 06:50:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436390544] [2025-03-08 06:50:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:56,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:56,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:56,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:50:56,495 INFO L87 Difference]: Start difference. First operand 6025 states and 8814 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-03-08 06:50:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:56,820 INFO L93 Difference]: Finished difference Result 9481 states and 13297 transitions. [2025-03-08 06:50:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:50:56,820 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-03-08 06:50:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:56,836 INFO L225 Difference]: With dead ends: 9481 [2025-03-08 06:50:56,837 INFO L226 Difference]: Without dead ends: 6157 [2025-03-08 06:50:56,843 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-03-08 06:50:56,844 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:56,844 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.1s Time] [2025-03-08 06:50:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6157 states. [2025-03-08 06:50:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6157 to 5167. [2025-03-08 06:50:56,984 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-03-08 06:50:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 7608 transitions. [2025-03-08 06:50:56,997 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 7608 transitions. Word has length 134 [2025-03-08 06:50:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:56,997 INFO L471 AbstractCegarLoop]: Abstraction has 5167 states and 7608 transitions. [2025-03-08 06:50:56,998 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-03-08 06:50:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 7608 transitions. [2025-03-08 06:50:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:50:57,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:57,001 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-03-08 06:50:57,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 06:50:57,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 06:50:57,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:57,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1615119401, now seen corresponding path program 1 times [2025-03-08 06:50:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127326484] [2025-03-08 06:50:57,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:57,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:50:57,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:50:57,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:57,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:57,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-03-08 06:50:57,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127326484] [2025-03-08 06:50:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127326484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557683128] [2025-03-08 06:50:57,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:57,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:57,255 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:57,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 06:50:57,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:50:57,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:50:57,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:57,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:57,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 06:50:57,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:50:57,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:50:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 06:50:57,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557683128] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:57,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 06:50:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-08 06:50:57,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643987544] [2025-03-08 06:50:57,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:57,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:50:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:57,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:50:57,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:50:57,482 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-03-08 06:50:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:57,944 INFO L93 Difference]: Finished difference Result 8984 states and 12128 transitions. [2025-03-08 06:50:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:57,944 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-03-08 06:50:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:57,969 INFO L225 Difference]: With dead ends: 8984 [2025-03-08 06:50:57,969 INFO L226 Difference]: Without dead ends: 7532 [2025-03-08 06:50:57,979 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-03-08 06:50:57,981 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-03-08 06:50:57,981 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-03-08 06:50:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7532 states. [2025-03-08 06:50:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7532 to 6278. [2025-03-08 06:50:58,249 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-03-08 06:50:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 8901 transitions. [2025-03-08 06:50:58,264 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 8901 transitions. Word has length 134 [2025-03-08 06:50:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:58,265 INFO L471 AbstractCegarLoop]: Abstraction has 6278 states and 8901 transitions. [2025-03-08 06:50:58,265 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-03-08 06:50:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 8901 transitions. [2025-03-08 06:50:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 06:50:58,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:58,269 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-03-08 06:50:58,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 06:50:58,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 06:50:58,474 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:58,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:58,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1698461743, now seen corresponding path program 1 times [2025-03-08 06:50:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:58,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307779834] [2025-03-08 06:50:58,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:58,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:58,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 06:50:58,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 06:50:58,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:58,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:50:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307779834] [2025-03-08 06:50:58,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307779834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325852235] [2025-03-08 06:50:58,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:58,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:58,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:58,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:58,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 06:50:58,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 06:50:58,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 06:50:58,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:58,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:58,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:50:58,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 06:50:58,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325852235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:50:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903361754] [2025-03-08 06:50:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:58,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:50:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:58,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:50:58,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:58,621 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-03-08 06:50:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:58,826 INFO L93 Difference]: Finished difference Result 8277 states and 11278 transitions. [2025-03-08 06:50:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:50:58,827 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-03-08 06:50:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:58,847 INFO L225 Difference]: With dead ends: 8277 [2025-03-08 06:50:58,847 INFO L226 Difference]: Without dead ends: 6282 [2025-03-08 06:50:58,854 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-03-08 06:50:58,854 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-03-08 06:50:58,855 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-03-08 06:50:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2025-03-08 06:50:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6282. [2025-03-08 06:50:59,136 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-03-08 06:50:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 8905 transitions. [2025-03-08 06:50:59,174 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 8905 transitions. Word has length 138 [2025-03-08 06:50:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:59,175 INFO L471 AbstractCegarLoop]: Abstraction has 6282 states and 8905 transitions. [2025-03-08 06:50:59,175 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-03-08 06:50:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 8905 transitions. [2025-03-08 06:50:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 06:50:59,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:59,188 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-03-08 06:50:59,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 06:50:59,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 06:50:59,389 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:59,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash 284302250, now seen corresponding path program 1 times [2025-03-08 06:50:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:59,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387033224] [2025-03-08 06:50:59,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:59,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:50:59,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:50:59,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:59,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:50:59,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387033224] [2025-03-08 06:50:59,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387033224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:50:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503961826] [2025-03-08 06:50:59,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:59,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:50:59,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:50:59,487 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:50:59,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 06:50:59,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:50:59,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:50:59,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:59,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:59,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 06:50:59,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:50:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 06:50:59,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:50:59,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503961826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:59,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:50:59,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 06:50:59,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924179384] [2025-03-08 06:50:59,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:59,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:59,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:59,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:59,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:50:59,582 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-03-08 06:50:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:59,763 INFO L93 Difference]: Finished difference Result 8360 states and 11419 transitions. [2025-03-08 06:50:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:50:59,763 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-03-08 06:50:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:59,779 INFO L225 Difference]: With dead ends: 8360 [2025-03-08 06:50:59,779 INFO L226 Difference]: Without dead ends: 4904 [2025-03-08 06:50:59,786 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-03-08 06:50:59,787 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-03-08 06:50:59,787 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-03-08 06:50:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2025-03-08 06:50:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4904. [2025-03-08 06:50:59,947 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-03-08 06:50:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 7163 transitions. [2025-03-08 06:50:59,957 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 7163 transitions. Word has length 139 [2025-03-08 06:50:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:59,957 INFO L471 AbstractCegarLoop]: Abstraction has 4904 states and 7163 transitions. [2025-03-08 06:50:59,957 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-03-08 06:50:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 7163 transitions. [2025-03-08 06:50:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 06:50:59,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:59,961 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-03-08 06:50:59,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 06:51:00,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 06:51:00,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:00,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash 458111660, now seen corresponding path program 1 times [2025-03-08 06:51:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:00,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566102251] [2025-03-08 06:51:00,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:00,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:51:00,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:51:00,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:00,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:51:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566102251] [2025-03-08 06:51:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566102251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:51:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440731523] [2025-03-08 06:51:00,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:00,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:51:00,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:51:00,208 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:51:00,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 06:51:00,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:51:00,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:51:00,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:00,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:00,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 06:51:00,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:51:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 06:51:00,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:51:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440731523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:00,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:51:00,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-08 06:51:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801354935] [2025-03-08 06:51:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:00,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:00,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:00,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:00,288 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-03-08 06:51:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:00,430 INFO L93 Difference]: Finished difference Result 6572 states and 9111 transitions. [2025-03-08 06:51:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:51:00,430 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-03-08 06:51:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:00,438 INFO L225 Difference]: With dead ends: 6572 [2025-03-08 06:51:00,438 INFO L226 Difference]: Without dead ends: 2900 [2025-03-08 06:51:00,442 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-03-08 06:51:00,442 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-03-08 06:51:00,442 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-03-08 06:51:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2025-03-08 06:51:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2900. [2025-03-08 06:51:00,487 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-03-08 06:51:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4829 transitions. [2025-03-08 06:51:00,493 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4829 transitions. Word has length 139 [2025-03-08 06:51:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:00,494 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 4829 transitions. [2025-03-08 06:51:00,494 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-03-08 06:51:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4829 transitions. [2025-03-08 06:51:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 06:51:00,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:00,495 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-03-08 06:51:00,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 06:51:00,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 06:51:00,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:00,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1762213900, now seen corresponding path program 1 times [2025-03-08 06:51:00,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633976502] [2025-03-08 06:51:00,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:00,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:51:00,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:51:00,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:00,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 06:51:00,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 06:51:00,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:51:00,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:51:00,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:00,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 06:51:00,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 06:51:00,773 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 06:51:00,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-08 06:51:00,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 06:51:00,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:51:00,778 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-03-08 06:51:00,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 06:51:00,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 06:51:00 BoogieIcfgContainer [2025-03-08 06:51:00,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 06:51:00,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 06:51:00,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 06:51:00,869 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 06:51:00,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:47" (3/4) ... [2025-03-08 06:51:00,870 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 06:51:00,986 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 102. [2025-03-08 06:51:01,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 06:51:01,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 06:51:01,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 06:51:01,069 INFO L158 Benchmark]: Toolchain (without parser) took 22316.28ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 99.1MB in the beginning and 328.1MB in the end (delta: -229.0MB). Peak memory consumption was 249.2MB. Max. memory is 16.1GB. [2025-03-08 06:51:01,069 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 125.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 06:51:01,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2026.24ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 99.1MB in the beginning and 160.3MB in the end (delta: -61.2MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. [2025-03-08 06:51:01,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 328.27ms. Allocated memory is still 276.8MB. Free memory was 160.3MB in the beginning and 84.6MB in the end (delta: 75.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-08 06:51:01,070 INFO L158 Benchmark]: Boogie Preprocessor took 441.68ms. Allocated memory is still 276.8MB. Free memory was 84.6MB in the beginning and 93.1MB in the end (delta: -8.5MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2025-03-08 06:51:01,070 INFO L158 Benchmark]: IcfgBuilder took 6339.89ms. Allocated memory was 276.8MB in the beginning and 562.0MB in the end (delta: 285.2MB). Free memory was 91.2MB in the beginning and 270.4MB in the end (delta: -179.3MB). Peak memory consumption was 327.1MB. Max. memory is 16.1GB. [2025-03-08 06:51:01,070 INFO L158 Benchmark]: TraceAbstraction took 12972.96ms. Allocated memory was 562.0MB in the beginning and 645.9MB in the end (delta: 83.9MB). Free memory was 270.4MB in the beginning and 353.3MB in the end (delta: -82.9MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2025-03-08 06:51:01,070 INFO L158 Benchmark]: Witness Printer took 200.23ms. Allocated memory is still 645.9MB. Free memory was 353.3MB in the beginning and 328.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 06:51:01,071 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.17ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 125.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2026.24ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 99.1MB in the beginning and 160.3MB in the end (delta: -61.2MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 328.27ms. Allocated memory is still 276.8MB. Free memory was 160.3MB in the beginning and 84.6MB in the end (delta: 75.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 441.68ms. Allocated memory is still 276.8MB. Free memory was 84.6MB in the beginning and 93.1MB in the end (delta: -8.5MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * IcfgBuilder took 6339.89ms. Allocated memory was 276.8MB in the beginning and 562.0MB in the end (delta: 285.2MB). Free memory was 91.2MB in the beginning and 270.4MB in the end (delta: -179.3MB). Peak memory consumption was 327.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12972.96ms. Allocated memory was 562.0MB in the beginning and 645.9MB in the end (delta: 83.9MB). Free memory was 270.4MB in the beginning and 353.3MB in the end (delta: -82.9MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 200.23ms. Allocated memory is still 645.9MB. Free memory was 353.3MB in the beginning and 328.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 11118]: 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, 4266 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45924 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45869 mSDsluCounter, 172754 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102564 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1375 IncrementalHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 70190 mSDtfsCounter, 1375 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1745 GetRequests, 1667 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6282occurred in iteration=15, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 2480 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3469 NumberOfCodeBlocks, 3469 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3434 ConstructedInterpolants, 0 QuantifiedInterpolants, 4403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4943 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 1510/1758 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-03-08 06:51:01,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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