/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 12:18:11,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 12:18:11,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 12:18:11,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 12:18:11,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 12:18:11,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 12:18:11,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 12:18:11,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 12:18:11,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 12:18:11,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 12:18:11,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 12:18:11,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 12:18:11,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 12:18:11,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 12:18:11,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 12:18:11,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 12:18:11,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 12:18:11,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 12:18:11,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 12:18:11,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 12:18:11,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 12:18:11,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 12:18:11,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 12:18:11,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 12:18:11,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 12:18:11,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 12:18:11,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 12:18:11,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 12:18:11,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 12:18:11,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 12:18:11,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 12:18:11,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 12:18:11,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 12:18:11,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 12:18:11,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 12:18:11,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 12:18:11,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 12:18:11,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 12:18:11,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 12:18:11,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 12:18:11,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 12:18:11,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 12:18:11,126 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 12:18:11,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 12:18:11,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 12:18:11,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 12:18:11,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 12:18:11,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 12:18:11,128 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 12:18:11,128 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 12:18:11,128 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 12:18:11,128 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 12:18:11,128 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 12:18:11,128 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 12:18:11,129 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 12:18:11,129 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 12:18:11,129 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 12:18:11,129 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 12:18:11,129 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 12:18:11,129 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 12:18:11,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 12:18:11,130 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 12:18:11,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 12:18:11,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 12:18:11,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 12:18:11,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 12:18:11,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 12:18:11,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 12:18:11,131 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 12:18:11,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 12:18:11,131 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 12:18:11,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 12:18:11,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 12:18:11,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 12:18:11,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:18:11,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 12:18:11,132 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 12:18:11,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 12:18:11,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 12:18:11,132 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 12:18:11,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 12:18:11,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 12:18:11,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 12:18:11,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 12:18:11,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 12:18:11,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 12:18:11,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 12:18:11,400 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 12:18:11,401 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 12:18:11,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-04-01 12:18:12,600 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 12:18:12,827 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 12:18:12,827 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-04-01 12:18:12,834 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0152d27e/60c1b6a27075404a8de1205104ec22d2/FLAGef11f55b9 [2023-04-01 12:18:12,845 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0152d27e/60c1b6a27075404a8de1205104ec22d2 [2023-04-01 12:18:12,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 12:18:12,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 12:18:12,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 12:18:12,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 12:18:12,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 12:18:12,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:18:12" (1/1) ... [2023-04-01 12:18:12,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45167c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:12, skipping insertion in model container [2023-04-01 12:18:12,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:18:12" (1/1) ... [2023-04-01 12:18:12,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 12:18:12,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 12:18:12,997 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-04-01 12:18:13,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:18:13,068 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 12:18:13,077 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-04-01 12:18:13,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:18:13,113 INFO L208 MainTranslator]: Completed translation [2023-04-01 12:18:13,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13 WrapperNode [2023-04-01 12:18:13,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 12:18:13,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 12:18:13,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 12:18:13,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 12:18:13,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,150 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 12:18:13,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 12:18:13,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 12:18:13,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 12:18:13,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (1/1) ... [2023-04-01 12:18:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:18:13,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:18:13,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 12:18:13,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 12:18:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 12:18:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 12:18:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 12:18:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-04-01 12:18:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2023-04-01 12:18:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2023-04-01 12:18:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2023-04-01 12:18:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2023-04-01 12:18:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2023-04-01 12:18:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2023-04-01 12:18:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-04-01 12:18:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-04-01 12:18:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-04-01 12:18:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-04-01 12:18:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-04-01 12:18:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-04-01 12:18:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-04-01 12:18:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-04-01 12:18:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-04-01 12:18:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-04-01 12:18:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-04-01 12:18:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-04-01 12:18:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-04-01 12:18:13,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 12:18:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 12:18:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 12:18:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 12:18:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 12:18:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 12:18:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-04-01 12:18:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2023-04-01 12:18:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2023-04-01 12:18:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2023-04-01 12:18:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-04-01 12:18:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure master [2023-04-01 12:18:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2023-04-01 12:18:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2023-04-01 12:18:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-04-01 12:18:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-04-01 12:18:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-04-01 12:18:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-04-01 12:18:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-04-01 12:18:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-04-01 12:18:13,241 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-04-01 12:18:13,241 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-04-01 12:18:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-04-01 12:18:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-04-01 12:18:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-04-01 12:18:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-04-01 12:18:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 12:18:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 12:18:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 12:18:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 12:18:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 12:18:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 12:18:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 12:18:13,309 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 12:18:13,311 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 12:18:13,674 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 12:18:13,816 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 12:18:13,817 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-01 12:18:13,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:18:13 BoogieIcfgContainer [2023-04-01 12:18:13,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 12:18:13,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 12:18:13,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 12:18:13,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 12:18:13,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:18:12" (1/3) ... [2023-04-01 12:18:13,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc0150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:18:13, skipping insertion in model container [2023-04-01 12:18:13,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:18:13" (2/3) ... [2023-04-01 12:18:13,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc0150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:18:13, skipping insertion in model container [2023-04-01 12:18:13,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:18:13" (3/3) ... [2023-04-01 12:18:13,837 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2023-04-01 12:18:13,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 12:18:13,855 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 12:18:13,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 12:18:13,917 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4e48f86c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 12:18:13,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 12:18:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 75 states have internal predecessors, (94), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-04-01 12:18:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-04-01 12:18:13,929 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:13,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:18:13,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:13,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -176831506, now seen corresponding path program 1 times [2023-04-01 12:18:13,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:13,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669430182] [2023-04-01 12:18:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:18:14,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669430182] [2023-04-01 12:18:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669430182] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:14,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 12:18:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519316835] [2023-04-01 12:18:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:14,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 12:18:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 12:18:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 12:18:14,575 INFO L87 Difference]: Start difference. First operand has 123 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 75 states have internal predecessors, (94), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-01 12:18:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:15,656 INFO L93 Difference]: Finished difference Result 892 states and 1297 transitions. [2023-04-01 12:18:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 12:18:15,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 64 [2023-04-01 12:18:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:15,690 INFO L225 Difference]: With dead ends: 892 [2023-04-01 12:18:15,690 INFO L226 Difference]: Without dead ends: 737 [2023-04-01 12:18:15,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-04-01 12:18:15,700 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 939 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:15,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 685 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 12:18:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2023-04-01 12:18:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 711. [2023-04-01 12:18:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 424 states have (on average 1.2877358490566038) internal successors, (546), 447 states have internal predecessors, (546), 168 states have call successors, (168), 128 states have call predecessors, (168), 118 states have return successors, (247), 157 states have call predecessors, (247), 164 states have call successors, (247) [2023-04-01 12:18:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 961 transitions. [2023-04-01 12:18:15,833 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 961 transitions. Word has length 64 [2023-04-01 12:18:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:15,834 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 961 transitions. [2023-04-01 12:18:15,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-01 12:18:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 961 transitions. [2023-04-01 12:18:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-04-01 12:18:15,849 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:15,849 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 12:18:15,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 12:18:15,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:15,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash -571091947, now seen corresponding path program 1 times [2023-04-01 12:18:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:15,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64934588] [2023-04-01 12:18:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 12:18:16,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64934588] [2023-04-01 12:18:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64934588] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-01 12:18:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466929058] [2023-04-01 12:18:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:16,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 12:18:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 12:18:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-01 12:18:16,099 INFO L87 Difference]: Start difference. First operand 711 states and 961 transitions. Second operand has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 12:18:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:16,797 INFO L93 Difference]: Finished difference Result 2354 states and 3547 transitions. [2023-04-01 12:18:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 12:18:16,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 78 [2023-04-01 12:18:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:16,815 INFO L225 Difference]: With dead ends: 2354 [2023-04-01 12:18:16,815 INFO L226 Difference]: Without dead ends: 1660 [2023-04-01 12:18:16,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-04-01 12:18:16,823 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 393 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:16,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 408 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 12:18:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2023-04-01 12:18:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1524. [2023-04-01 12:18:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 934 states have (on average 1.3126338329764453) internal successors, (1226), 1008 states have internal predecessors, (1226), 336 states have call successors, (336), 231 states have call predecessors, (336), 253 states have return successors, (648), 340 states have call predecessors, (648), 332 states have call successors, (648) [2023-04-01 12:18:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2210 transitions. [2023-04-01 12:18:16,990 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2210 transitions. Word has length 78 [2023-04-01 12:18:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:16,991 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 2210 transitions. [2023-04-01 12:18:16,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 12:18:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2210 transitions. [2023-04-01 12:18:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-04-01 12:18:16,992 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:16,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:18:16,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 12:18:16,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:16,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -381762039, now seen corresponding path program 1 times [2023-04-01 12:18:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218917957] [2023-04-01 12:18:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 12:18:17,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218917957] [2023-04-01 12:18:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218917957] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:17,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:17,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-01 12:18:17,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490654145] [2023-04-01 12:18:17,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:17,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 12:18:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:17,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 12:18:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-01 12:18:17,204 INFO L87 Difference]: Start difference. First operand 1524 states and 2210 transitions. Second operand has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 12:18:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:18,181 INFO L93 Difference]: Finished difference Result 5366 states and 9493 transitions. [2023-04-01 12:18:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 12:18:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 80 [2023-04-01 12:18:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:18,216 INFO L225 Difference]: With dead ends: 5366 [2023-04-01 12:18:18,216 INFO L226 Difference]: Without dead ends: 3859 [2023-04-01 12:18:18,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-04-01 12:18:18,240 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 408 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:18,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 414 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 12:18:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2023-04-01 12:18:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 3230. [2023-04-01 12:18:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3230 states, 2061 states have (on average 1.3231441048034935) internal successors, (2727), 2234 states have internal predecessors, (2727), 659 states have call successors, (659), 428 states have call predecessors, (659), 509 states have return successors, (1748), 661 states have call predecessors, (1748), 655 states have call successors, (1748) [2023-04-01 12:18:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 5134 transitions. [2023-04-01 12:18:18,603 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 5134 transitions. Word has length 80 [2023-04-01 12:18:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:18,603 INFO L495 AbstractCegarLoop]: Abstraction has 3230 states and 5134 transitions. [2023-04-01 12:18:18,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 12:18:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 5134 transitions. [2023-04-01 12:18:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-04-01 12:18:18,605 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:18,605 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 12:18:18,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 12:18:18,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:18,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2068213399, now seen corresponding path program 1 times [2023-04-01 12:18:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664469277] [2023-04-01 12:18:18,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 12:18:18,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664469277] [2023-04-01 12:18:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664469277] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:18,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 12:18:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617112967] [2023-04-01 12:18:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:18,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 12:18:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 12:18:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 12:18:18,673 INFO L87 Difference]: Start difference. First operand 3230 states and 5134 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-04-01 12:18:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:19,005 INFO L93 Difference]: Finished difference Result 5018 states and 8255 transitions. [2023-04-01 12:18:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 12:18:19,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2023-04-01 12:18:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:19,033 INFO L225 Difference]: With dead ends: 5018 [2023-04-01 12:18:19,034 INFO L226 Difference]: Without dead ends: 3940 [2023-04-01 12:18:19,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 12:18:19,046 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 67 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:19,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 311 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:18:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2023-04-01 12:18:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3858. [2023-04-01 12:18:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 2482 states have (on average 1.3158742949234488) internal successors, (3266), 2702 states have internal predecessors, (3266), 778 states have call successors, (778), 515 states have call predecessors, (778), 597 states have return successors, (2181), 747 states have call predecessors, (2181), 774 states have call successors, (2181) [2023-04-01 12:18:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 6225 transitions. [2023-04-01 12:18:19,426 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 6225 transitions. Word has length 82 [2023-04-01 12:18:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:19,427 INFO L495 AbstractCegarLoop]: Abstraction has 3858 states and 6225 transitions. [2023-04-01 12:18:19,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-04-01 12:18:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 6225 transitions. [2023-04-01 12:18:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-04-01 12:18:19,429 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:19,430 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:18:19,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 12:18:19,430 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:19,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1571285458, now seen corresponding path program 1 times [2023-04-01 12:18:19,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497828183] [2023-04-01 12:18:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-01 12:18:19,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497828183] [2023-04-01 12:18:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497828183] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 12:18:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119453351] [2023-04-01 12:18:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:19,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 12:18:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 12:18:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 12:18:19,563 INFO L87 Difference]: Start difference. First operand 3858 states and 6225 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-04-01 12:18:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:19,859 INFO L93 Difference]: Finished difference Result 5388 states and 8840 transitions. [2023-04-01 12:18:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 12:18:19,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2023-04-01 12:18:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:19,919 INFO L225 Difference]: With dead ends: 5388 [2023-04-01 12:18:19,919 INFO L226 Difference]: Without dead ends: 3518 [2023-04-01 12:18:19,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 12:18:19,936 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 106 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:19,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 241 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:18:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2023-04-01 12:18:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3434. [2023-04-01 12:18:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 2211 states have (on average 1.3021257349615558) internal successors, (2879), 2411 states have internal predecessors, (2879), 693 states have call successors, (693), 459 states have call predecessors, (693), 529 states have return successors, (1756), 662 states have call predecessors, (1756), 689 states have call successors, (1756) [2023-04-01 12:18:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 5328 transitions. [2023-04-01 12:18:20,279 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 5328 transitions. Word has length 100 [2023-04-01 12:18:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:20,279 INFO L495 AbstractCegarLoop]: Abstraction has 3434 states and 5328 transitions. [2023-04-01 12:18:20,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-04-01 12:18:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 5328 transitions. [2023-04-01 12:18:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-04-01 12:18:20,283 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:20,283 INFO L195 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, 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] [2023-04-01 12:18:20,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-01 12:18:20,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:20,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:20,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1468801646, now seen corresponding path program 1 times [2023-04-01 12:18:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113830866] [2023-04-01 12:18:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:20,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-04-01 12:18:20,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113830866] [2023-04-01 12:18:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113830866] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:20,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:20,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 12:18:20,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236937179] [2023-04-01 12:18:20,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:20,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 12:18:20,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:20,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 12:18:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:18:20,430 INFO L87 Difference]: Start difference. First operand 3434 states and 5328 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2023-04-01 12:18:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:21,349 INFO L93 Difference]: Finished difference Result 10336 states and 18285 transitions. [2023-04-01 12:18:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 12:18:21,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2023-04-01 12:18:21,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:21,402 INFO L225 Difference]: With dead ends: 10336 [2023-04-01 12:18:21,403 INFO L226 Difference]: Without dead ends: 6918 [2023-04-01 12:18:21,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-01 12:18:21,439 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 271 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:21,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 293 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 12:18:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2023-04-01 12:18:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 6596. [2023-04-01 12:18:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 4359 states have (on average 1.3092452397338838) internal successors, (5707), 4822 states have internal predecessors, (5707), 1295 states have call successors, (1295), 816 states have call predecessors, (1295), 941 states have return successors, (4032), 1158 states have call predecessors, (4032), 1291 states have call successors, (4032) [2023-04-01 12:18:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 11034 transitions. [2023-04-01 12:18:22,180 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 11034 transitions. Word has length 115 [2023-04-01 12:18:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:22,181 INFO L495 AbstractCegarLoop]: Abstraction has 6596 states and 11034 transitions. [2023-04-01 12:18:22,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2023-04-01 12:18:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 11034 transitions. [2023-04-01 12:18:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-04-01 12:18:22,185 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:22,185 INFO L195 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, 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] [2023-04-01 12:18:22,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-01 12:18:22,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:22,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash -732243116, now seen corresponding path program 1 times [2023-04-01 12:18:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:22,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697515486] [2023-04-01 12:18:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 12:18:22,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697515486] [2023-04-01 12:18:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697515486] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:22,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-01 12:18:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302223798] [2023-04-01 12:18:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:22,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 12:18:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 12:18:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-04-01 12:18:22,805 INFO L87 Difference]: Start difference. First operand 6596 states and 11034 transitions. Second operand has 13 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2023-04-01 12:18:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:26,148 INFO L93 Difference]: Finished difference Result 22201 states and 44574 transitions. [2023-04-01 12:18:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 12:18:26,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 116 [2023-04-01 12:18:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:26,276 INFO L225 Difference]: With dead ends: 22201 [2023-04-01 12:18:26,277 INFO L226 Difference]: Without dead ends: 16253 [2023-04-01 12:18:26,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 12:18:26,349 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1479 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:26,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 168 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-01 12:18:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2023-04-01 12:18:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 14176. [2023-04-01 12:18:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14176 states, 9617 states have (on average 1.3088281168763647) internal successors, (12587), 10574 states have internal predecessors, (12587), 2596 states have call successors, (2596), 1653 states have call predecessors, (2596), 1962 states have return successors, (8352), 2348 states have call predecessors, (8352), 2592 states have call successors, (8352) [2023-04-01 12:18:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 23535 transitions. [2023-04-01 12:18:28,486 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 23535 transitions. Word has length 116 [2023-04-01 12:18:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:28,487 INFO L495 AbstractCegarLoop]: Abstraction has 14176 states and 23535 transitions. [2023-04-01 12:18:28,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2023-04-01 12:18:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 23535 transitions. [2023-04-01 12:18:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-04-01 12:18:28,495 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:28,495 INFO L195 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, 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] [2023-04-01 12:18:28,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-01 12:18:28,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:28,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1329570267, now seen corresponding path program 1 times [2023-04-01 12:18:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:28,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646537578] [2023-04-01 12:18:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 12:18:28,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:28,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646537578] [2023-04-01 12:18:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646537578] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:28,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:28,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 12:18:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169499688] [2023-04-01 12:18:28,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:28,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 12:18:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 12:18:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-04-01 12:18:28,747 INFO L87 Difference]: Start difference. First operand 14176 states and 23535 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-04-01 12:18:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:30,622 INFO L93 Difference]: Finished difference Result 21111 states and 35187 transitions. [2023-04-01 12:18:30,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 12:18:30,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 117 [2023-04-01 12:18:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:30,724 INFO L225 Difference]: With dead ends: 21111 [2023-04-01 12:18:30,724 INFO L226 Difference]: Without dead ends: 17723 [2023-04-01 12:18:30,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-04-01 12:18:30,755 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 149 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:30,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 559 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 12:18:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17723 states. [2023-04-01 12:18:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17723 to 17650. [2023-04-01 12:18:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17650 states, 12000 states have (on average 1.301) internal successors, (15612), 13224 states have internal predecessors, (15612), 3244 states have call successors, (3244), 2000 states have call predecessors, (3244), 2405 states have return successors, (10234), 2928 states have call predecessors, (10234), 3240 states have call successors, (10234) [2023-04-01 12:18:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17650 states to 17650 states and 29090 transitions. [2023-04-01 12:18:32,779 INFO L78 Accepts]: Start accepts. Automaton has 17650 states and 29090 transitions. Word has length 117 [2023-04-01 12:18:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:32,780 INFO L495 AbstractCegarLoop]: Abstraction has 17650 states and 29090 transitions. [2023-04-01 12:18:32,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-04-01 12:18:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 17650 states and 29090 transitions. [2023-04-01 12:18:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-04-01 12:18:32,785 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:32,785 INFO L195 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, 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] [2023-04-01 12:18:32,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-01 12:18:32,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:32,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1511750510, now seen corresponding path program 1 times [2023-04-01 12:18:32,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:32,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266449676] [2023-04-01 12:18:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:32,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 12:18:32,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:32,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266449676] [2023-04-01 12:18:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266449676] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:18:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916184380] [2023-04-01 12:18:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:32,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:18:32,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:18:32,868 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) [2023-04-01 12:18:32,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 12:18:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:33,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-01 12:18:33,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:18:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:18:33,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 12:18:33,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916184380] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:33,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 12:18:33,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-04-01 12:18:33,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574299321] [2023-04-01 12:18:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:33,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 12:18:33,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:33,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 12:18:33,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 12:18:33,100 INFO L87 Difference]: Start difference. First operand 17650 states and 29090 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-04-01 12:18:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:34,910 INFO L93 Difference]: Finished difference Result 32242 states and 57030 transitions. [2023-04-01 12:18:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 12:18:34,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 119 [2023-04-01 12:18:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:35,007 INFO L225 Difference]: With dead ends: 32242 [2023-04-01 12:18:35,008 INFO L226 Difference]: Without dead ends: 17896 [2023-04-01 12:18:35,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 12:18:35,120 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 52 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:35,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 293 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:18:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17896 states. [2023-04-01 12:18:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17896 to 16656. [2023-04-01 12:18:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16656 states, 11223 states have (on average 1.2628530695892364) internal successors, (14173), 12184 states have internal predecessors, (14173), 3015 states have call successors, (3015), 2124 states have call predecessors, (3015), 2417 states have return successors, (8376), 2809 states have call predecessors, (8376), 3011 states have call successors, (8376) [2023-04-01 12:18:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16656 states to 16656 states and 25564 transitions. [2023-04-01 12:18:37,097 INFO L78 Accepts]: Start accepts. Automaton has 16656 states and 25564 transitions. Word has length 119 [2023-04-01 12:18:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:37,098 INFO L495 AbstractCegarLoop]: Abstraction has 16656 states and 25564 transitions. [2023-04-01 12:18:37,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-04-01 12:18:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 16656 states and 25564 transitions. [2023-04-01 12:18:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-04-01 12:18:37,110 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:37,110 INFO L195 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, 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] [2023-04-01 12:18:37,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 12:18:37,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:18:37,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:37,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash -544259481, now seen corresponding path program 1 times [2023-04-01 12:18:37,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:37,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202265531] [2023-04-01 12:18:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-01 12:18:37,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202265531] [2023-04-01 12:18:37,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202265531] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:18:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036339849] [2023-04-01 12:18:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:37,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:18:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:18:37,384 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) [2023-04-01 12:18:37,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 12:18:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:37,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 12:18:37,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:18:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-01 12:18:37,801 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 12:18:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036339849] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:37,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 12:18:37,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-04-01 12:18:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466761478] [2023-04-01 12:18:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:37,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 12:18:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 12:18:37,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 12:18:37,803 INFO L87 Difference]: Start difference. First operand 16656 states and 25564 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-04-01 12:18:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:39,414 INFO L93 Difference]: Finished difference Result 28646 states and 47550 transitions. [2023-04-01 12:18:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 12:18:39,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 154 [2023-04-01 12:18:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:39,491 INFO L225 Difference]: With dead ends: 28646 [2023-04-01 12:18:39,491 INFO L226 Difference]: Without dead ends: 15294 [2023-04-01 12:18:39,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 12:18:39,590 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 88 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:39,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 294 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:18:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15294 states. [2023-04-01 12:18:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15294 to 14778. [2023-04-01 12:18:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14778 states, 9909 states have (on average 1.2425068119891007) internal successors, (12312), 10688 states have internal predecessors, (12312), 2718 states have call successors, (2718), 1961 states have call predecessors, (2718), 2150 states have return successors, (5774), 2509 states have call predecessors, (5774), 2714 states have call successors, (5774) [2023-04-01 12:18:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14778 states to 14778 states and 20804 transitions. [2023-04-01 12:18:41,109 INFO L78 Accepts]: Start accepts. Automaton has 14778 states and 20804 transitions. Word has length 154 [2023-04-01 12:18:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:41,110 INFO L495 AbstractCegarLoop]: Abstraction has 14778 states and 20804 transitions. [2023-04-01 12:18:41,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-04-01 12:18:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 14778 states and 20804 transitions. [2023-04-01 12:18:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-04-01 12:18:41,120 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:41,121 INFO L195 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, 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] [2023-04-01 12:18:41,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-01 12:18:41,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 12:18:41,332 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:41,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash -306381369, now seen corresponding path program 1 times [2023-04-01 12:18:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:41,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853466107] [2023-04-01 12:18:41,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:41,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-01 12:18:41,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:41,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853466107] [2023-04-01 12:18:41,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853466107] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:41,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:18:41,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 12:18:41,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185010588] [2023-04-01 12:18:41,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:41,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 12:18:41,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:41,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 12:18:41,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 12:18:41,417 INFO L87 Difference]: Start difference. First operand 14778 states and 20804 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-04-01 12:18:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:43,179 INFO L93 Difference]: Finished difference Result 26117 states and 39443 transitions. [2023-04-01 12:18:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 12:18:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 154 [2023-04-01 12:18:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:43,267 INFO L225 Difference]: With dead ends: 26117 [2023-04-01 12:18:43,268 INFO L226 Difference]: Without dead ends: 15233 [2023-04-01 12:18:43,335 INFO L412 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 [2023-04-01 12:18:43,336 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 150 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:43,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 216 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:18:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2023-04-01 12:18:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 14877. [2023-04-01 12:18:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14877 states, 10011 states have (on average 1.222255518929178) internal successors, (12236), 10760 states have internal predecessors, (12236), 2683 states have call successors, (2683), 1973 states have call predecessors, (2683), 2182 states have return successors, (5654), 2522 states have call predecessors, (5654), 2679 states have call successors, (5654) [2023-04-01 12:18:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14877 states to 14877 states and 20573 transitions. [2023-04-01 12:18:44,772 INFO L78 Accepts]: Start accepts. Automaton has 14877 states and 20573 transitions. Word has length 154 [2023-04-01 12:18:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:44,772 INFO L495 AbstractCegarLoop]: Abstraction has 14877 states and 20573 transitions. [2023-04-01 12:18:44,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-04-01 12:18:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 14877 states and 20573 transitions. [2023-04-01 12:18:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-04-01 12:18:44,800 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:44,800 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2023-04-01 12:18:44,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-01 12:18:44,801 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:44,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1097477808, now seen corresponding path program 1 times [2023-04-01 12:18:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117965570] [2023-04-01 12:18:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-01 12:18:45,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117965570] [2023-04-01 12:18:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117965570] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:18:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108466342] [2023-04-01 12:18:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:45,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:18:45,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:18:45,056 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) [2023-04-01 12:18:45,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 12:18:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:45,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 12:18:45,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:18:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-01 12:18:45,304 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 12:18:45,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108466342] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:45,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 12:18:45,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-04-01 12:18:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765401433] [2023-04-01 12:18:45,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:45,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 12:18:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 12:18:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-04-01 12:18:45,306 INFO L87 Difference]: Start difference. First operand 14877 states and 20573 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2023-04-01 12:18:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:47,065 INFO L93 Difference]: Finished difference Result 24597 states and 35547 transitions. [2023-04-01 12:18:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 12:18:47,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 163 [2023-04-01 12:18:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:47,142 INFO L225 Difference]: With dead ends: 24597 [2023-04-01 12:18:47,142 INFO L226 Difference]: Without dead ends: 14258 [2023-04-01 12:18:47,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-04-01 12:18:47,198 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 106 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:47,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 883 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:18:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14258 states. [2023-04-01 12:18:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14258 to 14055. [2023-04-01 12:18:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14055 states, 9370 states have (on average 1.2024546424759872) internal successors, (11267), 10036 states have internal predecessors, (11267), 2566 states have call successors, (2566), 1945 states have call predecessors, (2566), 2118 states have return successors, (5216), 2411 states have call predecessors, (5216), 2562 states have call successors, (5216) [2023-04-01 12:18:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14055 states to 14055 states and 19049 transitions. [2023-04-01 12:18:48,703 INFO L78 Accepts]: Start accepts. Automaton has 14055 states and 19049 transitions. Word has length 163 [2023-04-01 12:18:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:48,703 INFO L495 AbstractCegarLoop]: Abstraction has 14055 states and 19049 transitions. [2023-04-01 12:18:48,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2023-04-01 12:18:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 14055 states and 19049 transitions. [2023-04-01 12:18:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-04-01 12:18:48,716 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:48,717 INFO L195 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, 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] [2023-04-01 12:18:48,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 12:18:48,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:18:48,925 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:48,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1984995291, now seen corresponding path program 1 times [2023-04-01 12:18:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89064173] [2023-04-01 12:18:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-04-01 12:18:49,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:49,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89064173] [2023-04-01 12:18:49,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89064173] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:18:49,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324186236] [2023-04-01 12:18:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:49,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:18:49,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:18:49,080 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) [2023-04-01 12:18:49,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 12:18:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:49,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 12:18:49,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:18:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 12:18:49,344 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 12:18:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324186236] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:49,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 12:18:49,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-04-01 12:18:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967995885] [2023-04-01 12:18:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:49,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 12:18:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:49,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 12:18:49,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-04-01 12:18:49,346 INFO L87 Difference]: Start difference. First operand 14055 states and 19049 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2023-04-01 12:18:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:51,092 INFO L93 Difference]: Finished difference Result 26468 states and 37042 transitions. [2023-04-01 12:18:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 12:18:51,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 155 [2023-04-01 12:18:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:51,177 INFO L225 Difference]: With dead ends: 26468 [2023-04-01 12:18:51,178 INFO L226 Difference]: Without dead ends: 17321 [2023-04-01 12:18:51,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-04-01 12:18:51,227 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 138 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:51,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 322 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:18:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17321 states. [2023-04-01 12:18:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17321 to 15458. [2023-04-01 12:18:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15458 states, 10331 states have (on average 1.1997870486884135) internal successors, (12395), 11116 states have internal predecessors, (12395), 2717 states have call successors, (2717), 2166 states have call predecessors, (2717), 2409 states have return successors, (5673), 2573 states have call predecessors, (5673), 2713 states have call successors, (5673) [2023-04-01 12:18:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15458 states to 15458 states and 20785 transitions. [2023-04-01 12:18:52,696 INFO L78 Accepts]: Start accepts. Automaton has 15458 states and 20785 transitions. Word has length 155 [2023-04-01 12:18:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:52,697 INFO L495 AbstractCegarLoop]: Abstraction has 15458 states and 20785 transitions. [2023-04-01 12:18:52,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2023-04-01 12:18:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 15458 states and 20785 transitions. [2023-04-01 12:18:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-04-01 12:18:52,710 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:52,710 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:18:52,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 12:18:52,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:18:52,917 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:52,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 112685629, now seen corresponding path program 1 times [2023-04-01 12:18:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:52,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014799959] [2023-04-01 12:18:52,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 31 proven. 39 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-04-01 12:18:53,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:18:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014799959] [2023-04-01 12:18:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014799959] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:18:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464576066] [2023-04-01 12:18:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:53,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:18:53,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:18:53,646 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) [2023-04-01 12:18:53,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 12:18:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:18:53,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 11 conjunts are in the unsatisfiable core [2023-04-01 12:18:53,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:18:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-04-01 12:18:53,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 12:18:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464576066] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:18:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 12:18:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 21 [2023-04-01 12:18:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485762785] [2023-04-01 12:18:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:18:53,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 12:18:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:18:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 12:18:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-04-01 12:18:53,899 INFO L87 Difference]: Start difference. First operand 15458 states and 20785 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2023-04-01 12:18:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:18:55,396 INFO L93 Difference]: Finished difference Result 28913 states and 39415 transitions. [2023-04-01 12:18:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 12:18:55,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 227 [2023-04-01 12:18:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:18:55,463 INFO L225 Difference]: With dead ends: 28913 [2023-04-01 12:18:55,464 INFO L226 Difference]: Without dead ends: 13530 [2023-04-01 12:18:55,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2023-04-01 12:18:55,518 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 88 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:18:55,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 674 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:18:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13530 states. [2023-04-01 12:18:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13530 to 10152. [2023-04-01 12:18:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10152 states, 6925 states have (on average 1.2018772563176896) internal successors, (8323), 7441 states have internal predecessors, (8323), 1746 states have call successors, (1746), 1402 states have call predecessors, (1746), 1480 states have return successors, (2573), 1623 states have call predecessors, (2573), 1742 states have call successors, (2573) [2023-04-01 12:18:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10152 states to 10152 states and 12642 transitions. [2023-04-01 12:18:56,598 INFO L78 Accepts]: Start accepts. Automaton has 10152 states and 12642 transitions. Word has length 227 [2023-04-01 12:18:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:18:56,600 INFO L495 AbstractCegarLoop]: Abstraction has 10152 states and 12642 transitions. [2023-04-01 12:18:56,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2023-04-01 12:18:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10152 states and 12642 transitions. [2023-04-01 12:18:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-04-01 12:18:56,607 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:18:56,607 INFO L195 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, 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] [2023-04-01 12:18:56,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 12:18:56,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 12:18:56,814 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:18:56,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:18:56,815 INFO L85 PathProgramCache]: Analyzing trace with hash 179597163, now seen corresponding path program 1 times [2023-04-01 12:18:56,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:18:56,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934739866] [2023-04-01 12:18:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:18:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:18:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 12:18:56,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 12:18:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 12:18:56,950 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 12:18:56,950 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 12:18:56,951 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 12:18:56,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-04-01 12:18:56,955 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:18:56,959 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 12:18:57,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 12:18:57 BoogieIcfgContainer [2023-04-01 12:18:57,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 12:18:57,088 INFO L158 Benchmark]: Toolchain (without parser) took 44239.87ms. Allocated memory was 366.0MB in the beginning and 4.4GB in the end (delta: 4.0GB). Free memory was 316.8MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-04-01 12:18:57,089 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 212.9MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 12:18:57,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 366.0MB. Free memory was 316.3MB in the beginning and 303.1MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-04-01 12:18:57,090 INFO L158 Benchmark]: Boogie Preprocessor took 38.54ms. Allocated memory is still 366.0MB. Free memory was 303.1MB in the beginning and 301.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-01 12:18:57,090 INFO L158 Benchmark]: RCFGBuilder took 668.82ms. Allocated memory is still 366.0MB. Free memory was 301.1MB in the beginning and 263.9MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-04-01 12:18:57,090 INFO L158 Benchmark]: TraceAbstraction took 43260.79ms. Allocated memory was 366.0MB in the beginning and 4.4GB in the end (delta: 4.0GB). Free memory was 263.4MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 972.7MB. Max. memory is 8.0GB. [2023-04-01 12:18:57,091 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 212.9MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 366.0MB. Free memory was 316.3MB in the beginning and 303.1MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.54ms. Allocated memory is still 366.0MB. Free memory was 303.1MB in the beginning and 301.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 668.82ms. Allocated memory is still 366.0MB. Free memory was 301.1MB in the beginning and 263.9MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 43260.79ms. Allocated memory was 366.0MB in the beginning and 4.4GB in the end (delta: 4.0GB). Free memory was 263.4MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 972.7MB. Max. memory is 8.0GB. * 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L573] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L577] CALL init_model() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 [L577] RET init_model() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L578] CALL start_simulation() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE m_i == 1 [L222] m_st = 0 [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 [L522] RET init_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) [L339] COND FALSE !(T1_E == 0) [L344] COND FALSE !(T2_E == 0) [L349] COND FALSE !(E_1 == 0) [L354] COND FALSE !(E_2 == 0) [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] CALL, EXPR is_master_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_master_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_transmit1_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_transmit2_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) [L372] COND FALSE !(T1_E == 1) [L377] COND FALSE !(T2_E == 1) [L382] COND FALSE !(E_1 == 1) [L387] COND FALSE !(E_2 == 1) [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 [L531] kernel_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L532] CALL eval() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L301] CALL transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L315] CALL transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 [L136] t2_pc = 1 [L137] t2_st = 2 [L315] RET transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L287] CALL master() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] CALL, EXPR is_master_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_master_triggered()=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit1_triggered()=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit2_triggered()=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L301] CALL transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] CALL, EXPR is_master_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_master_triggered()=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit1_triggered()=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit2_triggered()=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L315] CALL transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.1s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4510 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4434 mSDsluCounter, 5761 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3622 mSDsCounter, 2170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4893 IncrementalHoareTripleChecker+Invalid, 7063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2170 mSolverCounterUnsat, 2139 mSDtfsCounter, 4893 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1031 GetRequests, 888 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17650occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 10985 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2698 NumberOfCodeBlocks, 2698 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2523 ConstructedInterpolants, 0 QuantifiedInterpolants, 4148 SizeOfPredicates, 4 NumberOfNonLiveVariables, 4048 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 1256/1332 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 RESULT: Ultimate proved your program to be incorrect! [2023-04-01 12:18:57,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...