/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 04:52:47,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 04:52:47,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 04:52:47,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 04:52:47,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 04:52:47,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 04:52:47,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 04:52:47,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 04:52:47,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 04:52:47,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 04:52:47,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 04:52:47,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 04:52:47,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 04:52:47,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 04:52:47,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 04:52:47,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 04:52:47,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 04:52:47,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 04:52:47,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 04:52:47,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 04:52:47,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 04:52:47,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 04:52:47,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 04:52:47,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 04:52:47,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 04:52:47,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 04:52:47,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 04:52:47,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 04:52:47,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 04:52:47,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 04:52:47,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 04:52:47,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 04:52:47,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 04:52:47,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 04:52:47,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 04:52:47,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 04:52:47,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 04:52:47,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 04:52:47,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 04:52:47,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 04:52:47,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 04:52:47,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 04:52:47,188 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 04:52:47,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 04:52:47,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 04:52:47,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 04:52:47,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 04:52:47,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 04:52:47,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 04:52:47,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 04:52:47,190 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 04:52:47,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 04:52:47,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 04:52:47,192 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 04:52:47,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 04:52:47,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 04:52:47,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 04:52:47,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 04:52:47,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:52:47,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 04:52:47,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 04:52:47,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 04:52:47,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 04:52:47,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 04:52:47,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 04:52:47,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 04:52:47,193 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 04:52:47,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 04:52:47,193 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 04:52:47,193 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-02 04:52:47,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 04:52:47,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 04:52:47,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 04:52:47,411 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 04:52:47,413 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 04:52:47,414 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-02 04:52:48,397 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 04:52:48,598 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 04:52:48,599 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-04-02 04:52:48,607 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc824bb4/609de2ed50d84f26a8b0148dfa76e53d/FLAGc6001907e [2023-04-02 04:52:48,617 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc824bb4/609de2ed50d84f26a8b0148dfa76e53d [2023-04-02 04:52:48,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 04:52:48,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 04:52:48,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 04:52:48,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 04:52:48,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 04:52:48,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18431f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48, skipping insertion in model container [2023-04-02 04:52:48,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 04:52:48,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 04:52:48,755 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-02 04:52:48,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:52:48,824 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 04:52:48,834 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-02 04:52:48,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:52:48,882 INFO L208 MainTranslator]: Completed translation [2023-04-02 04:52:48,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48 WrapperNode [2023-04-02 04:52:48,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 04:52:48,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 04:52:48,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 04:52:48,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 04:52:48,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,927 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 04:52:48,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 04:52:48,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 04:52:48,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 04:52:48,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (1/1) ... [2023-04-02 04:52:48,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:52:48,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:52:48,970 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-02 04:52:48,976 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-02 04:52:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 04:52:49,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-04-02 04:52:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-04-02 04:52:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 04:52:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 04:52:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 04:52:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure master [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-04-02 04:52:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 04:52:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 04:52:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 04:52:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 04:52:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 04:52:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 04:52:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 04:52:49,061 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 04:52:49,062 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 04:52:49,363 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 04:52:49,377 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 04:52:49,377 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-02 04:52:49,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:52:49 BoogieIcfgContainer [2023-04-02 04:52:49,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 04:52:49,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 04:52:49,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 04:52:49,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 04:52:49,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 04:52:48" (1/3) ... [2023-04-02 04:52:49,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad63309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:52:49, skipping insertion in model container [2023-04-02 04:52:49,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:48" (2/3) ... [2023-04-02 04:52:49,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad63309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:52:49, skipping insertion in model container [2023-04-02 04:52:49,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:52:49" (3/3) ... [2023-04-02 04:52:49,384 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2023-04-02 04:52:49,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 04:52:49,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 04:52:49,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 04:52:49,432 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=PETRI_NET, 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;@79d4f26e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 04:52:49,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 04:52:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 114 states have (on average 1.5175438596491229) internal successors, (173), 121 states have internal predecessors, (173), 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-02 04:52:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:52:49,445 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:49,446 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, 1, 1, 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-02 04:52:49,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:49,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash -228882314, now seen corresponding path program 1 times [2023-04-02 04:52:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966360137] [2023-04-02 04:52:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:49,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:49,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:52:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:52:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:50,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:52:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:50,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:52:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:50,106 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-02 04:52:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966360137] [2023-04-02 04:52:50,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966360137] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:50,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:50,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252156773] [2023-04-02 04:52:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:50,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:50,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:50,145 INFO L87 Difference]: Start difference. First operand has 169 states, 114 states have (on average 1.5175438596491229) internal successors, (173), 121 states have internal predecessors, (173), 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 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:51,068 INFO L93 Difference]: Finished difference Result 408 states and 628 transitions. [2023-04-02 04:52:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 04:52:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-04-02 04:52:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:51,085 INFO L225 Difference]: With dead ends: 408 [2023-04-02 04:52:51,085 INFO L226 Difference]: Without dead ends: 247 [2023-04-02 04:52:51,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-04-02 04:52:51,093 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1060 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:51,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 40 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:52:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-04-02 04:52:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2023-04-02 04:52:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 109 states have (on average 1.385321100917431) internal successors, (151), 114 states have internal predecessors, (151), 31 states have call successors, (31), 22 states have call predecessors, (31), 19 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-04-02 04:52:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2023-04-02 04:52:51,167 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 90 [2023-04-02 04:52:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:51,168 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2023-04-02 04:52:51,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2023-04-02 04:52:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:52:51,175 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:51,175 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, 1, 1, 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-02 04:52:51,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 04:52:51,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:51,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1954509130, now seen corresponding path program 1 times [2023-04-02 04:52:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564507459] [2023-04-02 04:52:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:52:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:52:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:52:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:52:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,411 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-02 04:52:51,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:51,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564507459] [2023-04-02 04:52:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564507459] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:51,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:51,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:51,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65866779] [2023-04-02 04:52:51,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:51,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:51,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:51,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:51,414 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:52,085 INFO L93 Difference]: Finished difference Result 387 states and 548 transitions. [2023-04-02 04:52:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 04:52:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-04-02 04:52:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:52,088 INFO L225 Difference]: With dead ends: 387 [2023-04-02 04:52:52,088 INFO L226 Difference]: Without dead ends: 247 [2023-04-02 04:52:52,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-04-02 04:52:52,089 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1059 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:52,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 16 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 04:52:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-04-02 04:52:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2023-04-02 04:52:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 114 states have internal predecessors, (148), 31 states have call successors, (31), 22 states have call predecessors, (31), 19 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-04-02 04:52:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2023-04-02 04:52:52,117 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 90 [2023-04-02 04:52:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:52,117 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2023-04-02 04:52:52,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2023-04-02 04:52:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:52:52,118 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:52,118 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, 1, 1, 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-02 04:52:52,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 04:52:52,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:52,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash -763248522, now seen corresponding path program 1 times [2023-04-02 04:52:52,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:52,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309668585] [2023-04-02 04:52:52,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:52,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:52:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:52:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:52:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:52:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:52,266 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-02 04:52:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309668585] [2023-04-02 04:52:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309668585] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961638186] [2023-04-02 04:52:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:52,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:52,268 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:53,160 INFO L93 Difference]: Finished difference Result 466 states and 682 transitions. [2023-04-02 04:52:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 04:52:53,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-04-02 04:52:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:53,165 INFO L225 Difference]: With dead ends: 466 [2023-04-02 04:52:53,165 INFO L226 Difference]: Without dead ends: 326 [2023-04-02 04:52:53,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-04-02 04:52:53,167 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 945 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:53,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 16 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:52:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-04-02 04:52:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 196. [2023-04-02 04:52:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 136 states have (on average 1.3235294117647058) internal successors, (180), 141 states have internal predecessors, (180), 35 states have call successors, (35), 27 states have call predecessors, (35), 24 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-04-02 04:52:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 247 transitions. [2023-04-02 04:52:53,217 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 247 transitions. Word has length 90 [2023-04-02 04:52:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:53,217 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 247 transitions. [2023-04-02 04:52:53,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 247 transitions. [2023-04-02 04:52:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:52:53,218 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:53,218 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, 1, 1, 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-02 04:52:53,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 04:52:53,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:53,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1845538936, now seen corresponding path program 1 times [2023-04-02 04:52:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:53,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877333752] [2023-04-02 04:52:53,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:52:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:52:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:52:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:52:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:53,393 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-02 04:52:53,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877333752] [2023-04-02 04:52:53,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877333752] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:53,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:53,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:52:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656136732] [2023-04-02 04:52:53,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:53,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:52:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:53,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:52:53,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:52:53,397 INFO L87 Difference]: Start difference. First operand 196 states and 247 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:55,231 INFO L93 Difference]: Finished difference Result 1033 states and 1417 transitions. [2023-04-02 04:52:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-02 04:52:55,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-04-02 04:52:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:55,238 INFO L225 Difference]: With dead ends: 1033 [2023-04-02 04:52:55,238 INFO L226 Difference]: Without dead ends: 857 [2023-04-02 04:52:55,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-04-02 04:52:55,240 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1312 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:55,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 16 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-04-02 04:52:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-04-02 04:52:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 649. [2023-04-02 04:52:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 473 states have (on average 1.3530655391120507) internal successors, (640), 504 states have internal predecessors, (640), 98 states have call successors, (98), 72 states have call predecessors, (98), 77 states have return successors, (136), 96 states have call predecessors, (136), 95 states have call successors, (136) [2023-04-02 04:52:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 874 transitions. [2023-04-02 04:52:55,314 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 874 transitions. Word has length 90 [2023-04-02 04:52:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:55,315 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 874 transitions. [2023-04-02 04:52:55,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 874 transitions. [2023-04-02 04:52:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:52:55,316 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:55,316 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, 1, 1, 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-02 04:52:55,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 04:52:55,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:55,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1791146038, now seen corresponding path program 1 times [2023-04-02 04:52:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983345174] [2023-04-02 04:52:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:52:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:52:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:52:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:52:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:55,436 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-02 04:52:55,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:55,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983345174] [2023-04-02 04:52:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983345174] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:55,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190981559] [2023-04-02 04:52:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:55,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:55,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:55,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:55,438 INFO L87 Difference]: Start difference. First operand 649 states and 874 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-04-02 04:52:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:56,452 INFO L93 Difference]: Finished difference Result 1437 states and 1999 transitions. [2023-04-02 04:52:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:52:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2023-04-02 04:52:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:56,458 INFO L225 Difference]: With dead ends: 1437 [2023-04-02 04:52:56,458 INFO L226 Difference]: Without dead ends: 810 [2023-04-02 04:52:56,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-04-02 04:52:56,462 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 616 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:56,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 36 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:52:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2023-04-02 04:52:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 669. [2023-04-02 04:52:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 489 states have (on average 1.3353783231083844) internal successors, (653), 520 states have internal predecessors, (653), 98 states have call successors, (98), 72 states have call predecessors, (98), 81 states have return successors, (140), 100 states have call predecessors, (140), 95 states have call successors, (140) [2023-04-02 04:52:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 891 transitions. [2023-04-02 04:52:56,544 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 891 transitions. Word has length 90 [2023-04-02 04:52:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:56,544 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 891 transitions. [2023-04-02 04:52:56,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-04-02 04:52:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 891 transitions. [2023-04-02 04:52:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:52:56,545 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:56,545 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, 1, 1, 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-02 04:52:56,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 04:52:56,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:56,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash -237440072, now seen corresponding path program 1 times [2023-04-02 04:52:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217517691] [2023-04-02 04:52:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:52:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:52:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:52:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:52:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,684 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-02 04:52:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:56,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217517691] [2023-04-02 04:52:56,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217517691] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:56,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:56,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:56,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325649438] [2023-04-02 04:52:56,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:56,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:56,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:56,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:56,687 INFO L87 Difference]: Start difference. First operand 669 states and 891 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-04-02 04:52:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:57,787 INFO L93 Difference]: Finished difference Result 1472 states and 2024 transitions. [2023-04-02 04:52:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 04:52:57,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2023-04-02 04:52:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:57,791 INFO L225 Difference]: With dead ends: 1472 [2023-04-02 04:52:57,791 INFO L226 Difference]: Without dead ends: 825 [2023-04-02 04:52:57,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:52:57,793 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 312 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:57,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 38 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-02 04:52:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2023-04-02 04:52:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 689. [2023-04-02 04:52:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 505 states have (on average 1.3188118811881189) internal successors, (666), 536 states have internal predecessors, (666), 98 states have call successors, (98), 72 states have call predecessors, (98), 85 states have return successors, (144), 104 states have call predecessors, (144), 95 states have call successors, (144) [2023-04-02 04:52:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 908 transitions. [2023-04-02 04:52:57,861 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 908 transitions. Word has length 90 [2023-04-02 04:52:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:57,861 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 908 transitions. [2023-04-02 04:52:57,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-04-02 04:52:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 908 transitions. [2023-04-02 04:52:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:52:57,862 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:57,862 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, 1, 1, 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-02 04:52:57,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 04:52:57,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:57,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash 10706422, now seen corresponding path program 1 times [2023-04-02 04:52:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:57,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322335642] [2023-04-02 04:52:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:52:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:58,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:52:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:58,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:58,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:58,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:52:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:52:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:58,029 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-02 04:52:58,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:58,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322335642] [2023-04-02 04:52:58,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322335642] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:58,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:58,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:52:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291036678] [2023-04-02 04:52:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:58,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:52:58,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:58,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:52:58,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:52:58,032 INFO L87 Difference]: Start difference. First operand 689 states and 908 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:59,402 INFO L93 Difference]: Finished difference Result 2239 states and 3112 transitions. [2023-04-02 04:52:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 04:52:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-04-02 04:52:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:59,410 INFO L225 Difference]: With dead ends: 2239 [2023-04-02 04:52:59,410 INFO L226 Difference]: Without dead ends: 1572 [2023-04-02 04:52:59,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-04-02 04:52:59,414 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1563 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:59,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 15 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:52:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-04-02 04:52:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1352. [2023-04-02 04:52:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1004 states have (on average 1.3057768924302788) internal successors, (1311), 1061 states have internal predecessors, (1311), 181 states have call successors, (181), 135 states have call predecessors, (181), 166 states have return successors, (281), 194 states have call predecessors, (281), 177 states have call successors, (281) [2023-04-02 04:52:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1773 transitions. [2023-04-02 04:52:59,567 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1773 transitions. Word has length 90 [2023-04-02 04:52:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:59,567 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1773 transitions. [2023-04-02 04:52:59,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1773 transitions. [2023-04-02 04:52:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-04-02 04:52:59,569 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:59,569 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-04-02 04:52:59,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-02 04:52:59,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:59,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1419031621, now seen corresponding path program 1 times [2023-04-02 04:52:59,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:59,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590317087] [2023-04-02 04:52:59,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:52:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:52:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:52:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:52:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-02 04:52:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:52:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 04:52:59,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:59,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590317087] [2023-04-02 04:52:59,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590317087] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:59,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:59,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:52:59,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051987787] [2023-04-02 04:52:59,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:59,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:52:59,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:59,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:52:59,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:52:59,714 INFO L87 Difference]: Start difference. First operand 1352 states and 1773 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:53:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:00,943 INFO L93 Difference]: Finished difference Result 3058 states and 4232 transitions. [2023-04-02 04:53:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 04:53:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2023-04-02 04:53:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:00,951 INFO L225 Difference]: With dead ends: 3058 [2023-04-02 04:53:00,951 INFO L226 Difference]: Without dead ends: 1728 [2023-04-02 04:53:00,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2023-04-02 04:53:00,955 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 635 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:00,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 38 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-02 04:53:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2023-04-02 04:53:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1475. [2023-04-02 04:53:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1088 states have (on average 1.2996323529411764) internal successors, (1414), 1167 states have internal predecessors, (1414), 199 states have call successors, (199), 135 states have call predecessors, (199), 187 states have return successors, (374), 225 states have call predecessors, (374), 195 states have call successors, (374) [2023-04-02 04:53:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1987 transitions. [2023-04-02 04:53:01,158 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1987 transitions. Word has length 109 [2023-04-02 04:53:01,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:01,159 INFO L495 AbstractCegarLoop]: Abstraction has 1475 states and 1987 transitions. [2023-04-02 04:53:01,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:53:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1987 transitions. [2023-04-02 04:53:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-04-02 04:53:01,160 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:01,160 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-04-02 04:53:01,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-02 04:53:01,161 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:01,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1337595645, now seen corresponding path program 1 times [2023-04-02 04:53:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413196776] [2023-04-02 04:53:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:53:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:53:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:53:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-02 04:53:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:53:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 04:53:01,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:01,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413196776] [2023-04-02 04:53:01,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413196776] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:01,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:53:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305854116] [2023-04-02 04:53:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:01,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:53:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:01,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:53:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:01,317 INFO L87 Difference]: Start difference. First operand 1475 states and 1987 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:03,172 INFO L93 Difference]: Finished difference Result 3980 states and 5565 transitions. [2023-04-02 04:53:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-02 04:53:03,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2023-04-02 04:53:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:03,183 INFO L225 Difference]: With dead ends: 3980 [2023-04-02 04:53:03,183 INFO L226 Difference]: Without dead ends: 2526 [2023-04-02 04:53:03,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2023-04-02 04:53:03,188 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1865 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 743 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 743 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:03,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 17 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [743 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-02 04:53:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2023-04-02 04:53:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2148. [2023-04-02 04:53:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1588 states have (on average 1.276448362720403) internal successors, (2027), 1703 states have internal predecessors, (2027), 283 states have call successors, (283), 197 states have call predecessors, (283), 276 states have return successors, (524), 323 states have call predecessors, (524), 279 states have call successors, (524) [2023-04-02 04:53:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2834 transitions. [2023-04-02 04:53:03,418 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 2834 transitions. Word has length 109 [2023-04-02 04:53:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:03,419 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 2834 transitions. [2023-04-02 04:53:03,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2834 transitions. [2023-04-02 04:53:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-04-02 04:53:03,421 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:03,422 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-04-02 04:53:03,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-04-02 04:53:03,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:03,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:03,423 INFO L85 PathProgramCache]: Analyzing trace with hash 601566401, now seen corresponding path program 1 times [2023-04-02 04:53:03,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:03,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285918724] [2023-04-02 04:53:03,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:03,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:53:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:53:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:53:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-02 04:53:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:53:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 04:53:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285918724] [2023-04-02 04:53:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285918724] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:03,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:53:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252342706] [2023-04-02 04:53:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:03,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:53:03,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:03,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:53:03,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:53:03,653 INFO L87 Difference]: Start difference. First operand 2148 states and 2834 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:06,180 INFO L93 Difference]: Finished difference Result 5347 states and 7417 transitions. [2023-04-02 04:53:06,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-04-02 04:53:06,181 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2023-04-02 04:53:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:06,195 INFO L225 Difference]: With dead ends: 5347 [2023-04-02 04:53:06,195 INFO L226 Difference]: Without dead ends: 3588 [2023-04-02 04:53:06,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=476, Invalid=1504, Unknown=0, NotChecked=0, Total=1980 [2023-04-02 04:53:06,200 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1648 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:06,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 18 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-04-02 04:53:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2023-04-02 04:53:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 2806. [2023-04-02 04:53:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 2093 states have (on average 1.2881032011466793) internal successors, (2696), 2244 states have internal predecessors, (2696), 363 states have call successors, (363), 253 states have call predecessors, (363), 349 states have return successors, (735), 414 states have call predecessors, (735), 359 states have call successors, (735) [2023-04-02 04:53:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3794 transitions. [2023-04-02 04:53:06,534 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3794 transitions. Word has length 109 [2023-04-02 04:53:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:06,535 INFO L495 AbstractCegarLoop]: Abstraction has 2806 states and 3794 transitions. [2023-04-02 04:53:06,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3794 transitions. [2023-04-02 04:53:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-04-02 04:53:06,536 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:06,536 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-04-02 04:53:06,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-02 04:53:06,537 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:06,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1447821441, now seen corresponding path program 1 times [2023-04-02 04:53:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951417927] [2023-04-02 04:53:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:53:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:53:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:53:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-02 04:53:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:53:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 04:53:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951417927] [2023-04-02 04:53:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951417927] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:53:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732299568] [2023-04-02 04:53:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:06,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:53:06,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:53:06,672 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-02 04:53:06,679 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-02 04:53:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-02 04:53:06,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:53:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:06,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:53:06,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732299568] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:06,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:53:06,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-04-02 04:53:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887950714] [2023-04-02 04:53:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:06,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 04:53:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 04:53:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:06,838 INFO L87 Difference]: Start difference. First operand 2806 states and 3794 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 3 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-02 04:53:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:07,383 INFO L93 Difference]: Finished difference Result 7749 states and 10639 transitions. [2023-04-02 04:53:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 04:53:07,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 3 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 109 [2023-04-02 04:53:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:07,400 INFO L225 Difference]: With dead ends: 7749 [2023-04-02 04:53:07,400 INFO L226 Difference]: Without dead ends: 3907 [2023-04-02 04:53:07,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:07,410 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 157 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:07,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 547 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:53:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2023-04-02 04:53:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3865. [2023-04-02 04:53:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3865 states, 2891 states have (on average 1.280525769629886) internal successors, (3702), 3096 states have internal predecessors, (3702), 501 states have call successors, (501), 344 states have call predecessors, (501), 472 states have return successors, (1103), 573 states have call predecessors, (1103), 497 states have call successors, (1103) [2023-04-02 04:53:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 5306 transitions. [2023-04-02 04:53:07,866 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 5306 transitions. Word has length 109 [2023-04-02 04:53:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:07,866 INFO L495 AbstractCegarLoop]: Abstraction has 3865 states and 5306 transitions. [2023-04-02 04:53:07,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 3 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-02 04:53:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 5306 transitions. [2023-04-02 04:53:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-04-02 04:53:07,868 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:07,869 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, 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] [2023-04-02 04:53:07,877 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-02 04:53:08,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-02 04:53:08,075 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:08,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:08,076 INFO L85 PathProgramCache]: Analyzing trace with hash -963651463, now seen corresponding path program 1 times [2023-04-02 04:53:08,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:08,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223222789] [2023-04-02 04:53:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:53:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:53:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:53:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-02 04:53:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:53:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-04-02 04:53:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:53:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 04:53:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223222789] [2023-04-02 04:53:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223222789] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:53:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013481581] [2023-04-02 04:53:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:53:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:53:08,253 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-02 04:53:08,255 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-02 04:53:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:08,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 04:53:08,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:53:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 04:53:08,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:53:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013481581] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:08,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:53:08,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2023-04-02 04:53:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831260462] [2023-04-02 04:53:08,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:08,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 04:53:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 04:53:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:08,373 INFO L87 Difference]: Start difference. First operand 3865 states and 5306 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-04-02 04:53:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:08,992 INFO L93 Difference]: Finished difference Result 9933 states and 14113 transitions. [2023-04-02 04:53:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 04:53:08,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2023-04-02 04:53:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:09,020 INFO L225 Difference]: With dead ends: 9933 [2023-04-02 04:53:09,020 INFO L226 Difference]: Without dead ends: 6130 [2023-04-02 04:53:09,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:09,031 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 182 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:09,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 393 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:53:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6130 states. [2023-04-02 04:53:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 6012. [2023-04-02 04:53:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 4504 states have (on average 1.2737566607460036) internal successors, (5737), 4825 states have internal predecessors, (5737), 799 states have call successors, (799), 524 states have call predecessors, (799), 708 states have return successors, (1924), 895 states have call predecessors, (1924), 795 states have call successors, (1924) [2023-04-02 04:53:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 8460 transitions. [2023-04-02 04:53:09,758 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 8460 transitions. Word has length 153 [2023-04-02 04:53:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:09,758 INFO L495 AbstractCegarLoop]: Abstraction has 6012 states and 8460 transitions. [2023-04-02 04:53:09,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-04-02 04:53:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 8460 transitions. [2023-04-02 04:53:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-04-02 04:53:09,762 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:09,762 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, 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] [2023-04-02 04:53:09,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 04:53:09,968 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,SelfDestructingSolverStorable11 [2023-04-02 04:53:09,968 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:09,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2147387813, now seen corresponding path program 1 times [2023-04-02 04:53:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439994172] [2023-04-02 04:53:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:53:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:53:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:53:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-04-02 04:53:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-04-02 04:53:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-04-02 04:53:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:53:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-02 04:53:10,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:10,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439994172] [2023-04-02 04:53:10,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439994172] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:53:10,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523705933] [2023-04-02 04:53:10,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:10,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:53:10,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:53:10,124 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-02 04:53:10,127 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-02 04:53:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 04:53:10,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:53:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:10,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:53:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523705933] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:10,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:53:10,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-04-02 04:53:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305155611] [2023-04-02 04:53:10,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:10,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 04:53:10,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:10,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 04:53:10,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:53:10,272 INFO L87 Difference]: Start difference. First operand 6012 states and 8460 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-04-02 04:53:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:11,345 INFO L93 Difference]: Finished difference Result 16918 states and 24634 transitions. [2023-04-02 04:53:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 04:53:11,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2023-04-02 04:53:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:11,389 INFO L225 Difference]: With dead ends: 16918 [2023-04-02 04:53:11,390 INFO L226 Difference]: Without dead ends: 11013 [2023-04-02 04:53:11,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:53:11,416 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 162 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:11,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 490 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:53:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11013 states. [2023-04-02 04:53:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11013 to 10930. [2023-04-02 04:53:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10930 states, 8248 states have (on average 1.2478176527643066) internal successors, (10292), 8736 states have internal predecessors, (10292), 1404 states have call successors, (1404), 952 states have call predecessors, (1404), 1277 states have return successors, (3940), 1577 states have call predecessors, (3940), 1400 states have call successors, (3940) [2023-04-02 04:53:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10930 states to 10930 states and 15636 transitions. [2023-04-02 04:53:12,755 INFO L78 Accepts]: Start accepts. Automaton has 10930 states and 15636 transitions. Word has length 155 [2023-04-02 04:53:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:12,755 INFO L495 AbstractCegarLoop]: Abstraction has 10930 states and 15636 transitions. [2023-04-02 04:53:12,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-04-02 04:53:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 10930 states and 15636 transitions. [2023-04-02 04:53:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-04-02 04:53:12,761 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:12,762 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, 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] [2023-04-02 04:53:12,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-02 04:53:12,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:53:12,968 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:12,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:12,968 INFO L85 PathProgramCache]: Analyzing trace with hash -379372114, now seen corresponding path program 1 times [2023-04-02 04:53:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:12,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872555369] [2023-04-02 04:53:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:53:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:53:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:53:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-04-02 04:53:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-04-02 04:53:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:53:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-04-02 04:53:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:13,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872555369] [2023-04-02 04:53:13,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872555369] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:13,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:53:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151318242] [2023-04-02 04:53:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:13,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:53:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:53:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:53:13,152 INFO L87 Difference]: Start difference. First operand 10930 states and 15636 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 6 states have call successors, (21), 9 states have call predecessors, (21), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-04-02 04:53:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:17,171 INFO L93 Difference]: Finished difference Result 33260 states and 51577 transitions. [2023-04-02 04:53:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 04:53:17,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 6 states have call successors, (21), 9 states have call predecessors, (21), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 156 [2023-04-02 04:53:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:17,265 INFO L225 Difference]: With dead ends: 33260 [2023-04-02 04:53:17,265 INFO L226 Difference]: Without dead ends: 22449 [2023-04-02 04:53:17,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2023-04-02 04:53:17,325 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1735 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:17,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 17 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-02 04:53:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22449 states. [2023-04-02 04:53:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22449 to 20615. [2023-04-02 04:53:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20615 states, 15586 states have (on average 1.230976517387399) internal successors, (19186), 16449 states have internal predecessors, (19186), 2603 states have call successors, (2603), 1782 states have call predecessors, (2603), 2425 states have return successors, (6570), 2891 states have call predecessors, (6570), 2599 states have call successors, (6570) [2023-04-02 04:53:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20615 states to 20615 states and 28359 transitions. [2023-04-02 04:53:19,705 INFO L78 Accepts]: Start accepts. Automaton has 20615 states and 28359 transitions. Word has length 156 [2023-04-02 04:53:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:19,706 INFO L495 AbstractCegarLoop]: Abstraction has 20615 states and 28359 transitions. [2023-04-02 04:53:19,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 6 states have call successors, (21), 9 states have call predecessors, (21), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-04-02 04:53:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 20615 states and 28359 transitions. [2023-04-02 04:53:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-04-02 04:53:19,718 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:19,718 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, 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, 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, 1, 1, 1] [2023-04-02 04:53:19,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-04-02 04:53:19,718 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:19,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash -122755668, now seen corresponding path program 1 times [2023-04-02 04:53:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:19,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307277447] [2023-04-02 04:53:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:19,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:53:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:53:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:53:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-02 04:53:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-04-02 04:53:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-04-02 04:53:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-04-02 04:53:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:53:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-04-02 04:53:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:53:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:53:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-04-02 04:53:19,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:19,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307277447] [2023-04-02 04:53:19,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307277447] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:19,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:19,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:53:19,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346490697] [2023-04-02 04:53:19,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:19,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:53:19,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:53:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:53:19,863 INFO L87 Difference]: Start difference. First operand 20615 states and 28359 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 4 states have internal predecessors, (112), 5 states have call successors, (25), 9 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-04-02 04:53:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:23,472 INFO L93 Difference]: Finished difference Result 38638 states and 54689 transitions. [2023-04-02 04:53:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-02 04:53:23,473 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 4 states have internal predecessors, (112), 5 states have call successors, (25), 9 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 207 [2023-04-02 04:53:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:23,686 INFO L225 Difference]: With dead ends: 38638 [2023-04-02 04:53:23,687 INFO L226 Difference]: Without dead ends: 18210 [2023-04-02 04:53:23,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2023-04-02 04:53:23,754 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1081 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:23,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 18 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:53:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18210 states. [2023-04-02 04:53:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18210 to 17026. [2023-04-02 04:53:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17026 states, 12667 states have (on average 1.1889950264466724) internal successors, (15061), 13373 states have internal predecessors, (15061), 2234 states have call successors, (2234), 1591 states have call predecessors, (2234), 2124 states have return successors, (4371), 2412 states have call predecessors, (4371), 2230 states have call successors, (4371) [2023-04-02 04:53:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17026 states to 17026 states and 21666 transitions. [2023-04-02 04:53:25,728 INFO L78 Accepts]: Start accepts. Automaton has 17026 states and 21666 transitions. Word has length 207 [2023-04-02 04:53:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:25,729 INFO L495 AbstractCegarLoop]: Abstraction has 17026 states and 21666 transitions. [2023-04-02 04:53:25,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 4 states have internal predecessors, (112), 5 states have call successors, (25), 9 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-04-02 04:53:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17026 states and 21666 transitions. [2023-04-02 04:53:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-04-02 04:53:25,739 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:25,740 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, 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, 1, 1, 1, 1, 1] [2023-04-02 04:53:25,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-04-02 04:53:25,740 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:25,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 962130563, now seen corresponding path program 1 times [2023-04-02 04:53:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434423466] [2023-04-02 04:53:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:53:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:53:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:53:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-02 04:53:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-04-02 04:53:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-04-02 04:53:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-04-02 04:53:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:53:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-04-02 04:53:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:53:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:53:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:53:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-04-02 04:53:25,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:25,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434423466] [2023-04-02 04:53:25,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434423466] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:25,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:25,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:53:25,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120610962] [2023-04-02 04:53:25,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:25,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:53:25,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:25,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:53:25,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:53:25,887 INFO L87 Difference]: Start difference. First operand 17026 states and 21666 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (22), 10 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-04-02 04:53:28,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:28,589 INFO L93 Difference]: Finished difference Result 32097 states and 40637 transitions. [2023-04-02 04:53:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 04:53:28,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (22), 10 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 208 [2023-04-02 04:53:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:28,651 INFO L225 Difference]: With dead ends: 32097 [2023-04-02 04:53:28,651 INFO L226 Difference]: Without dead ends: 15175 [2023-04-02 04:53:28,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2023-04-02 04:53:28,691 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 879 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:28,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 18 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 04:53:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15175 states. [2023-04-02 04:53:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15175 to 14289. [2023-04-02 04:53:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14289 states, 10634 states have (on average 1.1913673123942072) internal successors, (12669), 11268 states have internal predecessors, (12669), 1870 states have call successors, (1870), 1306 states have call predecessors, (1870), 1784 states have return successors, (3441), 2025 states have call predecessors, (3441), 1866 states have call successors, (3441) [2023-04-02 04:53:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14289 states to 14289 states and 17980 transitions. [2023-04-02 04:53:30,506 INFO L78 Accepts]: Start accepts. Automaton has 14289 states and 17980 transitions. Word has length 208 [2023-04-02 04:53:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:30,506 INFO L495 AbstractCegarLoop]: Abstraction has 14289 states and 17980 transitions. [2023-04-02 04:53:30,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (22), 10 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-04-02 04:53:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 14289 states and 17980 transitions. [2023-04-02 04:53:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-04-02 04:53:30,514 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:30,514 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, 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, 1, 1, 1, 1, 1] [2023-04-02 04:53:30,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-04-02 04:53:30,514 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:30,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash 475056837, now seen corresponding path program 1 times [2023-04-02 04:53:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:30,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635110741] [2023-04-02 04:53:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:53:30,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 04:53:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:53:30,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 04:53:30,584 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 04:53:30,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 04:53:30,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-04-02 04:53:30,588 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:53:30,591 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 04:53:30,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 04:53:30 BoogieIcfgContainer [2023-04-02 04:53:30,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 04:53:30,698 INFO L158 Benchmark]: Toolchain (without parser) took 42077.73ms. Allocated memory was 238.0MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 203.1MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 346.9MB. Max. memory is 8.0GB. [2023-04-02 04:53:30,698 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 04:53:30,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.02ms. Allocated memory is still 238.0MB. Free memory was 203.1MB in the beginning and 189.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-04-02 04:53:30,699 INFO L158 Benchmark]: Boogie Preprocessor took 47.45ms. Allocated memory is still 238.0MB. Free memory was 189.4MB in the beginning and 187.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 04:53:30,699 INFO L158 Benchmark]: RCFGBuilder took 446.68ms. Allocated memory is still 238.0MB. Free memory was 187.3MB in the beginning and 165.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-04-02 04:53:30,699 INFO L158 Benchmark]: TraceAbstraction took 41317.69ms. Allocated memory was 238.0MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 164.8MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 309.2MB. Max. memory is 8.0GB. [2023-04-02 04:53:30,700 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.14ms. Allocated memory is still 192.9MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.02ms. Allocated memory is still 238.0MB. Free memory was 203.1MB in the beginning and 189.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.45ms. Allocated memory is still 238.0MB. Free memory was 189.4MB in the beginning and 187.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 446.68ms. Allocated memory is still 238.0MB. Free memory was 187.3MB in the beginning and 165.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 41317.69ms. Allocated memory was 238.0MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 164.8MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 309.2MB. 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; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=62, \old(E_2)=50, \old(M_E)=58, \old(T1_E)=57, \old(T2_E)=49, \old(m_i)=53, \old(m_pc)=63, \old(m_st)=64, \old(t1_i)=51, \old(t1_pc)=60, \old(t1_st)=54, \old(t2_i)=59, \old(t2_pc)=55, \old(t2_st)=52, 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] [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 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] [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 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] [L226] COND TRUE t1_i == 1 [L227] t1_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, 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] [L231] COND TRUE t2_i == 1 [L232] t2_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, 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] 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) 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] [L339] COND FALSE !(T1_E == 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] [L344] COND FALSE !(T2_E == 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] [L349] COND FALSE !(E_1 == 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] [L354] COND FALSE !(E_2 == 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] [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); 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, \result=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] [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); 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, \result=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] [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); 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, \result=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] [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)) 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, tmp___1=0] [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) 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] [L372] COND FALSE !(T1_E == 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] [L377] COND FALSE !(T2_E == 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] [L382] COND FALSE !(E_1 == 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] [L387] COND FALSE !(E_2 == 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] [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 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] [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 ; 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] [L244] COND TRUE m_st == 0 [L245] __retres1 = 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, __retres1=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] [L262] return (__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, \result=1, __retres1=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] 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 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] [L101] t1_pc = 1 [L102] t1_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)=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=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0] [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 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] [L136] t2_pc = 1 [L137] t2_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)=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=1, 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 ; 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] [L244] COND TRUE m_st == 0 [L245] __retres1 = 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, __retres1=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] [L262] return (__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, \result=1, __retres1=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] [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 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] [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); 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, \result=0, __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] [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); 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, \result=1, __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] [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); 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, \result=0, __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] [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)) 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, tmp___1=0] [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 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] [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 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] [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); 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, \result=0, __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] [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); 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, \result=0, __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] [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); 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, \result=1, __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] [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 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, tmp=0, tmp___0=0, tmp___1=1] [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 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] [L101] t1_pc = 1 [L102] t1_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)=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=2, t2_i=1, t2_pc=1, t2_st=0] [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, 172 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15381 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15211 mSDsluCounter, 1733 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 782 mSDsCounter, 5679 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17880 IncrementalHoareTripleChecker+Invalid, 23559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5679 mSolverCounterUnsat, 951 mSDtfsCounter, 17880 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1250 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20615occurred in iteration=14, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 6569 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2570 NumberOfCodeBlocks, 2570 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2343 ConstructedInterpolants, 0 QuantifiedInterpolants, 5285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1863 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 499/527 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-02 04:53:30,716 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...