/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/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 04:43:06,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 04:43:06,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 04:43:06,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 04:43:06,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 04:43:06,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 04:43:06,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 04:43:06,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 04:43:06,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 04:43:06,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 04:43:06,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 04:43:06,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 04:43:06,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 04:43:06,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 04:43:06,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 04:43:06,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 04:43:06,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 04:43:06,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 04:43:06,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 04:43:06,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 04:43:06,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 04:43:06,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 04:43:06,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 04:43:06,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 04:43:06,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 04:43:06,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 04:43:06,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 04:43:06,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 04:43:06,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 04:43:06,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 04:43:06,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 04:43:06,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 04:43:06,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 04:43:06,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 04:43:06,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 04:43:06,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 04:43:06,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 04:43:06,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 04:43:06,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 04:43:06,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 04:43:06,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 04:43:06,995 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:43:07,012 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 04:43:07,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 04:43:07,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 04:43:07,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 04:43:07,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 04:43:07,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 04:43:07,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 04:43:07,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 04:43:07,015 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 04:43:07,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 04:43:07,015 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 04:43:07,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 04:43:07,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 04:43:07,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 04:43:07,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 04:43:07,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 04:43:07,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 04:43:07,017 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 04:43:07,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 04:43:07,017 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 04:43:07,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 04:43:07,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 04:43:07,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 04:43:07,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 04:43:07,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:43:07,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 04:43:07,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 04:43:07,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 04:43:07,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 04:43:07,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 04:43:07,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 04:43:07,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 04:43:07,019 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 04:43:07,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 04:43:07,019 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 04:43:07,019 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:43:07,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 04:43:07,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 04:43:07,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 04:43:07,235 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 04:43:07,235 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 04:43:07,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2023-04-02 04:43:08,457 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 04:43:08,672 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 04:43:08,673 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2023-04-02 04:43:08,684 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b02c54693/79a0ec6324e148088461866fbc70a679/FLAG96396f3ea [2023-04-02 04:43:09,056 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b02c54693/79a0ec6324e148088461866fbc70a679 [2023-04-02 04:43:09,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 04:43:09,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 04:43:09,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 04:43:09,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 04:43:09,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 04:43:09,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5004364b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09, skipping insertion in model container [2023-04-02 04:43:09,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 04:43:09,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 04:43:09,228 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/kundu1.cil.c[636,649] [2023-04-02 04:43:09,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:43:09,283 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 04:43:09,296 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/kundu1.cil.c[636,649] [2023-04-02 04:43:09,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:43:09,338 INFO L208 MainTranslator]: Completed translation [2023-04-02 04:43:09,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09 WrapperNode [2023-04-02 04:43:09,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 04:43:09,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 04:43:09,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 04:43:09,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 04:43:09,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,374 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 04:43:09,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 04:43:09,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 04:43:09,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 04:43:09,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (1/1) ... [2023-04-02 04:43:09,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:43:09,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:09,401 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:43:09,405 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:43:09,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 04:43:09,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 04:43:09,434 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 04:43:09,434 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-04-02 04:43:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2023-04-02 04:43:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2023-04-02 04:43:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2023-04-02 04:43:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2023-04-02 04:43:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2023-04-02 04:43:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2023-04-02 04:43:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-04-02 04:43:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-04-02 04:43:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-04-02 04:43:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-04-02 04:43:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-04-02 04:43:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-04-02 04:43:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-04-02 04:43:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-04-02 04:43:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-04-02 04:43:09,437 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-04-02 04:43:09,437 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-04-02 04:43:09,437 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-04-02 04:43:09,437 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-04-02 04:43:09,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 04:43:09,437 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 04:43:09,437 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 04:43:09,437 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 04:43:09,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 04:43:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 04:43:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-04-02 04:43:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-04-02 04:43:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2023-04-02 04:43:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2023-04-02 04:43:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2023-04-02 04:43:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2023-04-02 04:43:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2023-04-02 04:43:09,439 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2023-04-02 04:43:09,439 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-04-02 04:43:09,439 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-04-02 04:43:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-04-02 04:43:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-04-02 04:43:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-04-02 04:43:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-04-02 04:43:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-04-02 04:43:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-04-02 04:43:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-04-02 04:43:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-04-02 04:43:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-04-02 04:43:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-04-02 04:43:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 04:43:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 04:43:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 04:43:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 04:43:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 04:43:09,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 04:43:09,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 04:43:09,572 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 04:43:09,574 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 04:43:09,922 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 04:43:09,929 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 04:43:09,929 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-04-02 04:43:09,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:43:09 BoogieIcfgContainer [2023-04-02 04:43:09,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 04:43:09,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 04:43:09,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 04:43:09,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 04:43:09,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 04:43:09" (1/3) ... [2023-04-02 04:43:09,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ed1c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:43:09, skipping insertion in model container [2023-04-02 04:43:09,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:43:09" (2/3) ... [2023-04-02 04:43:09,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ed1c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:43:09, skipping insertion in model container [2023-04-02 04:43:09,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:43:09" (3/3) ... [2023-04-02 04:43:09,941 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2023-04-02 04:43:09,960 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 04:43:09,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 04:43:10,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 04:43:10,020 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;@2b3c99ed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 04:43:10,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 04:43:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 105 states have internal predecessors, (140), 30 states have call successors, (30), 21 states have call predecessors, (30), 21 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-04-02 04:43:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-04-02 04:43:10,040 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:10,040 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] [2023-04-02 04:43:10,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:10,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:10,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2000967350, now seen corresponding path program 1 times [2023-04-02 04:43:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:10,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782172895] [2023-04-02 04:43:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-04-02 04:43:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-04-02 04:43:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:10,709 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:43:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:10,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782172895] [2023-04-02 04:43:10,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782172895] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:10,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:10,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 04:43:10,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029231579] [2023-04-02 04:43:10,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:10,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 04:43:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 04:43:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-02 04:43:10,759 INFO L87 Difference]: Start difference. First operand has 152 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 105 states have internal predecessors, (140), 30 states have call successors, (30), 21 states have call predecessors, (30), 21 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:43:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:12,124 INFO L93 Difference]: Finished difference Result 437 states and 614 transitions. [2023-04-02 04:43:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:43:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 72 [2023-04-02 04:43:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:12,137 INFO L225 Difference]: With dead ends: 437 [2023-04-02 04:43:12,137 INFO L226 Difference]: Without dead ends: 293 [2023-04-02 04:43:12,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:43:12,144 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 679 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:12,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 46 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:43:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-04-02 04:43:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 255. [2023-04-02 04:43:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 173 states have (on average 1.369942196531792) internal successors, (237), 183 states have internal predecessors, (237), 48 states have call successors, (48), 35 states have call predecessors, (48), 33 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2023-04-02 04:43:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 331 transitions. [2023-04-02 04:43:12,265 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 331 transitions. Word has length 72 [2023-04-02 04:43:12,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:12,266 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 331 transitions. [2023-04-02 04:43:12,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:43:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 331 transitions. [2023-04-02 04:43:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-04-02 04:43:12,271 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:12,271 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] [2023-04-02 04:43:12,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 04:43:12,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:12,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1127489655, now seen corresponding path program 1 times [2023-04-02 04:43:12,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:12,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316027951] [2023-04-02 04:43:12,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:12,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-04-02 04:43:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-04-02 04:43:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:12,548 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:43:12,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:12,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316027951] [2023-04-02 04:43:12,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316027951] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:12,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:12,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:43:12,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524229094] [2023-04-02 04:43:12,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:12,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:43:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:12,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:43:12,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:43:12,552 INFO L87 Difference]: Start difference. First operand 255 states and 331 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:43:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:13,385 INFO L93 Difference]: Finished difference Result 520 states and 687 transitions. [2023-04-02 04:43:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 04:43:13,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2023-04-02 04:43:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:13,389 INFO L225 Difference]: With dead ends: 520 [2023-04-02 04:43:13,390 INFO L226 Difference]: Without dead ends: 285 [2023-04-02 04:43:13,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-04-02 04:43:13,393 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 256 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:13,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 39 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 04:43:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-04-02 04:43:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2023-04-02 04:43:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 177 states have (on average 1.3559322033898304) internal successors, (240), 187 states have internal predecessors, (240), 48 states have call successors, (48), 35 states have call predecessors, (48), 34 states have return successors, (47), 44 states have call predecessors, (47), 43 states have call successors, (47) [2023-04-02 04:43:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 335 transitions. [2023-04-02 04:43:13,463 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 335 transitions. Word has length 72 [2023-04-02 04:43:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:13,463 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 335 transitions. [2023-04-02 04:43:13,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:43:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 335 transitions. [2023-04-02 04:43:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-04-02 04:43:13,469 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:13,470 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] [2023-04-02 04:43:13,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 04:43:13,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:13,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash -717877511, now seen corresponding path program 1 times [2023-04-02 04:43:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525979814] [2023-04-02 04:43:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-04-02 04:43:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-04-02 04:43:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:13,803 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:43:13,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:13,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525979814] [2023-04-02 04:43:13,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525979814] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:13,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:13,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:43:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421181532] [2023-04-02 04:43:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:13,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:43:13,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:43:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:43:13,806 INFO L87 Difference]: Start difference. First operand 260 states and 335 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 4 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:43:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:16,352 INFO L93 Difference]: Finished difference Result 1271 states and 1771 transitions. [2023-04-02 04:43:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 04:43:16,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 4 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 72 [2023-04-02 04:43:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:16,364 INFO L225 Difference]: With dead ends: 1271 [2023-04-02 04:43:16,365 INFO L226 Difference]: Without dead ends: 1031 [2023-04-02 04:43:16,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2023-04-02 04:43:16,375 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1190 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2041 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 2041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:16,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 17 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 2041 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-04-02 04:43:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-04-02 04:43:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 873. [2023-04-02 04:43:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 604 states have (on average 1.3211920529801324) internal successors, (798), 636 states have internal predecessors, (798), 150 states have call successors, (150), 113 states have call predecessors, (150), 118 states have return successors, (223), 146 states have call predecessors, (223), 145 states have call successors, (223) [2023-04-02 04:43:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1171 transitions. [2023-04-02 04:43:16,520 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1171 transitions. Word has length 72 [2023-04-02 04:43:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:16,520 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1171 transitions. [2023-04-02 04:43:16,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 4 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:43:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1171 transitions. [2023-04-02 04:43:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-04-02 04:43:16,522 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:16,522 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] [2023-04-02 04:43:16,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 04:43:16,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:16,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1022825478, now seen corresponding path program 1 times [2023-04-02 04:43:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:16,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689458464] [2023-04-02 04:43:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:16,686 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:43:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689458464] [2023-04-02 04:43:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689458464] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:16,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:16,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 04:43:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133986839] [2023-04-02 04:43:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:16,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 04:43:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:16,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 04:43:16,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-02 04:43:16,690 INFO L87 Difference]: Start difference. First operand 873 states and 1171 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:43:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:17,858 INFO L93 Difference]: Finished difference Result 2025 states and 2820 transitions. [2023-04-02 04:43:17,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 04:43:17,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 73 [2023-04-02 04:43:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:17,865 INFO L225 Difference]: With dead ends: 2025 [2023-04-02 04:43:17,866 INFO L226 Difference]: Without dead ends: 1172 [2023-04-02 04:43:17,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-04-02 04:43:17,871 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 627 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:17,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 14 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-02 04:43:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-04-02 04:43:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1035. [2023-04-02 04:43:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 717 states have (on average 1.298465829846583) internal successors, (931), 755 states have internal predecessors, (931), 176 states have call successors, (176), 135 states have call predecessors, (176), 141 states have return successors, (258), 172 states have call predecessors, (258), 171 states have call successors, (258) [2023-04-02 04:43:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1365 transitions. [2023-04-02 04:43:18,031 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1365 transitions. Word has length 73 [2023-04-02 04:43:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:18,032 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1365 transitions. [2023-04-02 04:43:18,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:43:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1365 transitions. [2023-04-02 04:43:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-04-02 04:43:18,033 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:18,033 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] [2023-04-02 04:43:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 04:43:18,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:18,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1507325209, now seen corresponding path program 1 times [2023-04-02 04:43:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:18,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139190165] [2023-04-02 04:43:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:18,187 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:43:18,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:18,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139190165] [2023-04-02 04:43:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139190165] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:18,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:43:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522386562] [2023-04-02 04:43:18,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:18,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:43:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:18,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:43:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:43:18,189 INFO L87 Difference]: Start difference. First operand 1035 states and 1365 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:43:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:19,096 INFO L93 Difference]: Finished difference Result 2148 states and 2873 transitions. [2023-04-02 04:43:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:43:19,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 73 [2023-04-02 04:43:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:19,103 INFO L225 Difference]: With dead ends: 2148 [2023-04-02 04:43:19,103 INFO L226 Difference]: Without dead ends: 1133 [2023-04-02 04:43:19,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-04-02 04:43:19,111 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 360 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:19,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 39 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 04:43:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2023-04-02 04:43:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1065. [2023-04-02 04:43:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 741 states have (on average 1.2847503373819162) internal successors, (952), 779 states have internal predecessors, (952), 176 states have call successors, (176), 135 states have call predecessors, (176), 147 states have return successors, (264), 178 states have call predecessors, (264), 171 states have call successors, (264) [2023-04-02 04:43:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1392 transitions. [2023-04-02 04:43:19,270 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1392 transitions. Word has length 73 [2023-04-02 04:43:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:19,271 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1392 transitions. [2023-04-02 04:43:19,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:43:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1392 transitions. [2023-04-02 04:43:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-04-02 04:43:19,273 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:19,273 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] [2023-04-02 04:43:19,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 04:43:19,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:19,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1529957463, now seen corresponding path program 1 times [2023-04-02 04:43:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82166603] [2023-04-02 04:43:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:19,431 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:43:19,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82166603] [2023-04-02 04:43:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82166603] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:43:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059131096] [2023-04-02 04:43:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:19,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:43:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:43:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:43:19,434 INFO L87 Difference]: Start difference. First operand 1065 states and 1392 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:43:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:20,421 INFO L93 Difference]: Finished difference Result 2225 states and 2989 transitions. [2023-04-02 04:43:20,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 04:43:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 73 [2023-04-02 04:43:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:20,428 INFO L225 Difference]: With dead ends: 2225 [2023-04-02 04:43:20,429 INFO L226 Difference]: Without dead ends: 1271 [2023-04-02 04:43:20,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2023-04-02 04:43:20,433 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 663 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:20,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 26 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:43:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2023-04-02 04:43:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1182. [2023-04-02 04:43:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 823 states have (on average 1.2818955042527338) internal successors, (1055), 866 states have internal predecessors, (1055), 194 states have call successors, (194), 149 states have call predecessors, (194), 164 states have return successors, (300), 196 states have call predecessors, (300), 189 states have call successors, (300) [2023-04-02 04:43:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1549 transitions. [2023-04-02 04:43:20,627 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1549 transitions. Word has length 73 [2023-04-02 04:43:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:20,627 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1549 transitions. [2023-04-02 04:43:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:43:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1549 transitions. [2023-04-02 04:43:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-04-02 04:43:20,633 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:20,633 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] [2023-04-02 04:43:20,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 04:43:20,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:20,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1567812877, now seen corresponding path program 1 times [2023-04-02 04:43:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:20,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725891288] [2023-04-02 04:43:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-04-02 04:43:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:20,951 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:43:20,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725891288] [2023-04-02 04:43:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725891288] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-04-02 04:43:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082388483] [2023-04-02 04:43:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:20,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 04:43:20,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:20,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 04:43:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-04-02 04:43:20,953 INFO L87 Difference]: Start difference. First operand 1182 states and 1549 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (17), 9 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:43:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:23,282 INFO L93 Difference]: Finished difference Result 2632 states and 3737 transitions. [2023-04-02 04:43:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-04-02 04:43:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (17), 9 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 86 [2023-04-02 04:43:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:23,295 INFO L225 Difference]: With dead ends: 2632 [2023-04-02 04:43:23,296 INFO L226 Difference]: Without dead ends: 1785 [2023-04-02 04:43:23,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=450, Invalid=1442, Unknown=0, NotChecked=0, Total=1892 [2023-04-02 04:43:23,303 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1426 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 618 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 618 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:23,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 30 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [618 Valid, 1895 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 04:43:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2023-04-02 04:43:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1569. [2023-04-02 04:43:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1090 states have (on average 1.306422018348624) internal successors, (1424), 1183 states have internal predecessors, (1424), 266 states have call successors, (266), 177 states have call predecessors, (266), 212 states have return successors, (495), 270 states have call predecessors, (495), 261 states have call successors, (495) [2023-04-02 04:43:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2185 transitions. [2023-04-02 04:43:23,523 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2185 transitions. Word has length 86 [2023-04-02 04:43:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:23,524 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2185 transitions. [2023-04-02 04:43:23,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (17), 9 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:43:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2185 transitions. [2023-04-02 04:43:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:43:23,525 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:23,526 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:43:23,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-02 04:43:23,527 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:23,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash 112682784, now seen corresponding path program 1 times [2023-04-02 04:43:23,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:23,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426780221] [2023-04-02 04:43:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-04-02 04:43:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:23,849 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:43:23,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:23,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426780221] [2023-04-02 04:43:23,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426780221] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:23,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:23,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-02 04:43:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341102756] [2023-04-02 04:43:23,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:23,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:43:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:43:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:43:23,851 INFO L87 Difference]: Start difference. First operand 1569 states and 2185 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 10 states have call predecessors, (18), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:43:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:26,448 INFO L93 Difference]: Finished difference Result 3795 states and 5684 transitions. [2023-04-02 04:43:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-04-02 04:43:26,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 10 states have call predecessors, (18), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2023-04-02 04:43:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:26,465 INFO L225 Difference]: With dead ends: 3795 [2023-04-02 04:43:26,465 INFO L226 Difference]: Without dead ends: 2823 [2023-04-02 04:43:26,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2023-04-02 04:43:26,474 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1115 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:26,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 44 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-04-02 04:43:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2023-04-02 04:43:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2435. [2023-04-02 04:43:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 1693 states have (on average 1.301831069108092) internal successors, (2204), 1839 states have internal predecessors, (2204), 410 states have call successors, (410), 271 states have call predecessors, (410), 331 states have return successors, (899), 423 states have call predecessors, (899), 405 states have call successors, (899) [2023-04-02 04:43:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3513 transitions. [2023-04-02 04:43:26,794 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3513 transitions. Word has length 90 [2023-04-02 04:43:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:26,794 INFO L495 AbstractCegarLoop]: Abstraction has 2435 states and 3513 transitions. [2023-04-02 04:43:26,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 10 states have call predecessors, (18), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:43:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3513 transitions. [2023-04-02 04:43:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-04-02 04:43:26,796 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:26,796 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] [2023-04-02 04:43:26,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-02 04:43:26,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:26,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 660538284, now seen corresponding path program 1 times [2023-04-02 04:43:26,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:26,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170443050] [2023-04-02 04:43:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-04-02 04:43:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-04-02 04:43:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 04:43:26,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:26,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170443050] [2023-04-02 04:43:26,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170443050] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:43:26,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793903594] [2023-04-02 04:43:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:26,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:26,949 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:43:26,951 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:43:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:27,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-02 04:43:27,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:43:27,119 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:43:27,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:43:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793903594] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:27,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:43:27,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-04-02 04:43:27,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440491239] [2023-04-02 04:43:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:27,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 04:43:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:27,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 04:43:27,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:43:27,121 INFO L87 Difference]: Start difference. First operand 2435 states and 3513 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:43:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:27,693 INFO L93 Difference]: Finished difference Result 6796 states and 10281 transitions. [2023-04-02 04:43:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 04:43:27,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2023-04-02 04:43:27,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:27,716 INFO L225 Difference]: With dead ends: 6796 [2023-04-02 04:43:27,716 INFO L226 Difference]: Without dead ends: 4382 [2023-04-02 04:43:27,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:43:27,738 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 117 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:27,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 461 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:43:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2023-04-02 04:43:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4327. [2023-04-02 04:43:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 2996 states have (on average 1.2570093457943925) internal successors, (3766), 3202 states have internal predecessors, (3766), 721 states have call successors, (721), 506 states have call predecessors, (721), 609 states have return successors, (1319), 760 states have call predecessors, (1319), 716 states have call successors, (1319) [2023-04-02 04:43:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5806 transitions. [2023-04-02 04:43:28,273 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5806 transitions. Word has length 92 [2023-04-02 04:43:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:28,274 INFO L495 AbstractCegarLoop]: Abstraction has 4327 states and 5806 transitions. [2023-04-02 04:43:28,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:43:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5806 transitions. [2023-04-02 04:43:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-04-02 04:43:28,278 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:28,278 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 04:43:28,285 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:43:28,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:28,484 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:28,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:28,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1484629443, now seen corresponding path program 1 times [2023-04-02 04:43:28,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:28,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121947264] [2023-04-02 04:43:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:28,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-04-02 04:43:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-04-02 04:43:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 04:43:28,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:28,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121947264] [2023-04-02 04:43:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121947264] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:43:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572406109] [2023-04-02 04:43:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:28,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:43:28,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:28,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:43:28,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:43:28,682 INFO L87 Difference]: Start difference. First operand 4327 states and 5806 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 4 states have call successors, (19), 8 states have call predecessors, (19), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-04-02 04:43:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:30,407 INFO L93 Difference]: Finished difference Result 9480 states and 13223 transitions. [2023-04-02 04:43:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 04:43:30,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 4 states have call successors, (19), 8 states have call predecessors, (19), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 97 [2023-04-02 04:43:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:30,436 INFO L225 Difference]: With dead ends: 9480 [2023-04-02 04:43:30,436 INFO L226 Difference]: Without dead ends: 5179 [2023-04-02 04:43:30,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=491, Unknown=0, NotChecked=0, Total=702 [2023-04-02 04:43:30,454 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 789 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:30,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 15 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-02 04:43:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2023-04-02 04:43:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 4634. [2023-04-02 04:43:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4634 states, 3206 states have (on average 1.2479725514660012) internal successors, (4001), 3481 states have internal predecessors, (4001), 775 states have call successors, (775), 506 states have call predecessors, (775), 652 states have return successors, (1404), 814 states have call predecessors, (1404), 770 states have call successors, (1404) [2023-04-02 04:43:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4634 states to 4634 states and 6180 transitions. [2023-04-02 04:43:30,976 INFO L78 Accepts]: Start accepts. Automaton has 4634 states and 6180 transitions. Word has length 97 [2023-04-02 04:43:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:30,976 INFO L495 AbstractCegarLoop]: Abstraction has 4634 states and 6180 transitions. [2023-04-02 04:43:30,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 4 states have call successors, (19), 8 states have call predecessors, (19), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-04-02 04:43:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4634 states and 6180 transitions. [2023-04-02 04:43:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-04-02 04:43:30,980 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:30,980 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 04:43:30,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-02 04:43:30,980 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:30,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash 342126977, now seen corresponding path program 1 times [2023-04-02 04:43:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:30,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247975974] [2023-04-02 04:43:30,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-04-02 04:43:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-04-02 04:43:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 04:43:31,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:31,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247975974] [2023-04-02 04:43:31,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247975974] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:31,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:31,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:43:31,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266359718] [2023-04-02 04:43:31,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:31,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:43:31,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:31,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:43:31,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:43:31,108 INFO L87 Difference]: Start difference. First operand 4634 states and 6180 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:43:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:32,310 INFO L93 Difference]: Finished difference Result 5708 states and 7657 transitions. [2023-04-02 04:43:32,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 04:43:32,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2023-04-02 04:43:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:32,337 INFO L225 Difference]: With dead ends: 5708 [2023-04-02 04:43:32,337 INFO L226 Difference]: Without dead ends: 5199 [2023-04-02 04:43:32,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2023-04-02 04:43:32,341 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 657 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:32,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 17 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 04:43:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2023-04-02 04:43:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4629. [2023-04-02 04:43:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 3205 states have (on average 1.2477379095163807) internal successors, (3999), 3479 states have internal predecessors, (3999), 772 states have call successors, (772), 506 states have call predecessors, (772), 651 states have return successors, (1400), 810 states have call predecessors, (1400), 767 states have call successors, (1400) [2023-04-02 04:43:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 6171 transitions. [2023-04-02 04:43:32,969 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 6171 transitions. Word has length 97 [2023-04-02 04:43:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:32,969 INFO L495 AbstractCegarLoop]: Abstraction has 4629 states and 6171 transitions. [2023-04-02 04:43:32,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:43:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 6171 transitions. [2023-04-02 04:43:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-04-02 04:43:32,971 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:32,971 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 04:43:32,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-02 04:43:32,971 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:32,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1004024432, now seen corresponding path program 1 times [2023-04-02 04:43:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:32,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029742906] [2023-04-02 04:43:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:43:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-04-02 04:43:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-04-02 04:43:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 04:43:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029742906] [2023-04-02 04:43:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029742906] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:43:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:43:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400184334] [2023-04-02 04:43:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:33,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:43:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:43:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:43:33,142 INFO L87 Difference]: Start difference. First operand 4629 states and 6171 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (19), 8 states have call predecessors, (19), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:43:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:36,306 INFO L93 Difference]: Finished difference Result 13387 states and 18411 transitions. [2023-04-02 04:43:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-04-02 04:43:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (19), 8 states have call predecessors, (19), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 98 [2023-04-02 04:43:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:36,350 INFO L225 Difference]: With dead ends: 13387 [2023-04-02 04:43:36,351 INFO L226 Difference]: Without dead ends: 8455 [2023-04-02 04:43:36,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2023-04-02 04:43:36,377 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2380 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 1326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1326 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:36,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2380 Valid, 18 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1326 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-04-02 04:43:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8455 states. [2023-04-02 04:43:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8455 to 8033. [2023-04-02 04:43:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8033 states, 5554 states have (on average 1.1759092545912855) internal successors, (6531), 5898 states have internal predecessors, (6531), 1301 states have call successors, (1301), 919 states have call predecessors, (1301), 1177 states have return successors, (1994), 1412 states have call predecessors, (1994), 1296 states have call successors, (1994) [2023-04-02 04:43:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8033 states to 8033 states and 9826 transitions. [2023-04-02 04:43:37,435 INFO L78 Accepts]: Start accepts. Automaton has 8033 states and 9826 transitions. Word has length 98 [2023-04-02 04:43:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:37,436 INFO L495 AbstractCegarLoop]: Abstraction has 8033 states and 9826 transitions. [2023-04-02 04:43:37,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (19), 8 states have call predecessors, (19), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:43:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8033 states and 9826 transitions. [2023-04-02 04:43:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-04-02 04:43:37,443 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:37,443 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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] [2023-04-02 04:43:37,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-04-02 04:43:37,443 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:37,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash 532002086, now seen corresponding path program 1 times [2023-04-02 04:43:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185895843] [2023-04-02 04:43:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 04:43:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-04-02 04:43:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:43:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-02 04:43:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-04-02 04:43:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:43:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-04-02 04:43:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-04-02 04:43:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-04-02 04:43:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-04-02 04:43:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-04-02 04:43:37,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:37,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185895843] [2023-04-02 04:43:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185895843] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:43:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308039300] [2023-04-02 04:43:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:37,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:37,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:37,685 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:43:37,688 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:43:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:37,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-02 04:43:37,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:43:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-04-02 04:43:37,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:43:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308039300] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:37,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:43:37,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2023-04-02 04:43:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495696012] [2023-04-02 04:43:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:37,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 04:43:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:37,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 04:43:37,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:43:37,962 INFO L87 Difference]: Start difference. First operand 8033 states and 9826 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2023-04-02 04:43:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:38,783 INFO L93 Difference]: Finished difference Result 12770 states and 15713 transitions. [2023-04-02 04:43:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 04:43:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 165 [2023-04-02 04:43:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:38,808 INFO L225 Difference]: With dead ends: 12770 [2023-04-02 04:43:38,808 INFO L226 Difference]: Without dead ends: 5623 [2023-04-02 04:43:38,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:43:38,826 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 91 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:38,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:43:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5623 states. [2023-04-02 04:43:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5623 to 5606. [2023-04-02 04:43:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 3870 states have (on average 1.1744186046511629) internal successors, (4545), 4114 states have internal predecessors, (4545), 918 states have call successors, (918), 645 states have call predecessors, (918), 817 states have return successors, (1364), 986 states have call predecessors, (1364), 914 states have call successors, (1364) [2023-04-02 04:43:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 6827 transitions. [2023-04-02 04:43:39,426 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 6827 transitions. Word has length 165 [2023-04-02 04:43:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:39,426 INFO L495 AbstractCegarLoop]: Abstraction has 5606 states and 6827 transitions. [2023-04-02 04:43:39,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2023-04-02 04:43:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 6827 transitions. [2023-04-02 04:43:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-04-02 04:43:39,431 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:39,431 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 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] [2023-04-02 04:43:39,441 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:43:39,637 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,SelfDestructingSolverStorable12 [2023-04-02 04:43:39,638 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:39,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1325048801, now seen corresponding path program 1 times [2023-04-02 04:43:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317842222] [2023-04-02 04:43:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 04:43:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:43:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-04-02 04:43:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-04-02 04:43:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-04-02 04:43:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-04-02 04:43:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-02 04:43:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-04-02 04:43:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-04-02 04:43:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-04-02 04:43:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:39,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317842222] [2023-04-02 04:43:39,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317842222] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:43:39,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410999510] [2023-04-02 04:43:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:39,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:39,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:39,871 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:43:39,875 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:43:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:39,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 04:43:39,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:43:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-04-02 04:43:40,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:43:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410999510] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:40,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:43:40,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2023-04-02 04:43:40,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572194508] [2023-04-02 04:43:40,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:40,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 04:43:40,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:40,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 04:43:40,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:43:40,153 INFO L87 Difference]: Start difference. First operand 5606 states and 6827 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2023-04-02 04:43:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:41,276 INFO L93 Difference]: Finished difference Result 11695 states and 14209 transitions. [2023-04-02 04:43:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 04:43:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 171 [2023-04-02 04:43:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:41,306 INFO L225 Difference]: With dead ends: 11695 [2023-04-02 04:43:41,306 INFO L226 Difference]: Without dead ends: 6417 [2023-04-02 04:43:41,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:43:41,323 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 56 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:41,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 331 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:43:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6417 states. [2023-04-02 04:43:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6417 to 6399. [2023-04-02 04:43:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 4429 states have (on average 1.1655001128923008) internal successors, (5162), 4698 states have internal predecessors, (5162), 1042 states have call successors, (1042), 737 states have call predecessors, (1042), 927 states have return successors, (1507), 1116 states have call predecessors, (1507), 1038 states have call successors, (1507) [2023-04-02 04:43:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 7711 transitions. [2023-04-02 04:43:42,016 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 7711 transitions. Word has length 171 [2023-04-02 04:43:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:42,017 INFO L495 AbstractCegarLoop]: Abstraction has 6399 states and 7711 transitions. [2023-04-02 04:43:42,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2023-04-02 04:43:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 7711 transitions. [2023-04-02 04:43:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-04-02 04:43:42,022 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:42,023 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:42,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 04:43:42,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:42,234 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:42,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1533033499, now seen corresponding path program 1 times [2023-04-02 04:43:42,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:42,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609317031] [2023-04-02 04:43:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 04:43:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:43:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-04-02 04:43:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-04-02 04:43:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-04-02 04:43:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:43:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-04-02 04:43:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-04-02 04:43:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-04-02 04:43:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-04-02 04:43:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-04-02 04:43:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-04-02 04:43:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-04-02 04:43:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-04-02 04:43:42,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:42,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609317031] [2023-04-02 04:43:42,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609317031] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:43:42,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464934298] [2023-04-02 04:43:42,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:42,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:42,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:42,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 04:43:42,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 04:43:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:42,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 04:43:42,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:43:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-04-02 04:43:42,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:43:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464934298] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:43:42,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 14 [2023-04-02 04:43:42,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186553856] [2023-04-02 04:43:42,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:42,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 04:43:42,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:42,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 04:43:42,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:43:42,704 INFO L87 Difference]: Start difference. First operand 6399 states and 7711 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2023-04-02 04:43:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:43,201 INFO L93 Difference]: Finished difference Result 11068 states and 13416 transitions. [2023-04-02 04:43:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 04:43:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 205 [2023-04-02 04:43:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:43,219 INFO L225 Difference]: With dead ends: 11068 [2023-04-02 04:43:43,219 INFO L226 Difference]: Without dead ends: 4690 [2023-04-02 04:43:43,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-04-02 04:43:43,232 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 12 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:43,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 849 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:43:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2023-04-02 04:43:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 4387. [2023-04-02 04:43:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4387 states, 3156 states have (on average 1.1625475285171103) internal successors, (3669), 3309 states have internal predecessors, (3669), 638 states have call successors, (638), 463 states have call predecessors, (638), 592 states have return successors, (908), 715 states have call predecessors, (908), 634 states have call successors, (908) [2023-04-02 04:43:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 4387 states and 5215 transitions. [2023-04-02 04:43:43,712 INFO L78 Accepts]: Start accepts. Automaton has 4387 states and 5215 transitions. Word has length 205 [2023-04-02 04:43:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:43,713 INFO L495 AbstractCegarLoop]: Abstraction has 4387 states and 5215 transitions. [2023-04-02 04:43:43,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2023-04-02 04:43:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4387 states and 5215 transitions. [2023-04-02 04:43:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-04-02 04:43:43,717 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:43,717 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:43,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-02 04:43:43,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-02 04:43:43,925 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:43,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1672556001, now seen corresponding path program 1 times [2023-04-02 04:43:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:43,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871624151] [2023-04-02 04:43:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 04:43:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-02 04:43:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-04-02 04:43:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-04-02 04:43:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-04-02 04:43:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-04-02 04:43:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:43:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-04-02 04:43:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-04-02 04:43:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-04-02 04:43:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-04-02 04:43:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-04-02 04:43:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-04-02 04:43:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-04-02 04:43:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-04-02 04:43:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871624151] [2023-04-02 04:43:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871624151] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:43:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68654585] [2023-04-02 04:43:44,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:44,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:44,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:44,310 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 04:43:44,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 04:43:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:44,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 9 conjunts are in the unsatisfiable core [2023-04-02 04:43:44,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:43:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-04-02 04:43:44,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:43:44,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68654585] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:44,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:43:44,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2023-04-02 04:43:44,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168493451] [2023-04-02 04:43:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:44,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 04:43:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 04:43:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-04-02 04:43:44,813 INFO L87 Difference]: Start difference. First operand 4387 states and 5215 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 6 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2023-04-02 04:43:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:45,848 INFO L93 Difference]: Finished difference Result 10843 states and 13107 transitions. [2023-04-02 04:43:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 04:43:45,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 6 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 212 [2023-04-02 04:43:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:45,858 INFO L225 Difference]: With dead ends: 10843 [2023-04-02 04:43:45,859 INFO L226 Difference]: Without dead ends: 3518 [2023-04-02 04:43:45,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-04-02 04:43:45,871 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 295 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:45,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 320 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-02 04:43:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2023-04-02 04:43:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3454. [2023-04-02 04:43:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2484 states have (on average 1.1594202898550725) internal successors, (2880), 2563 states have internal predecessors, (2880), 505 states have call successors, (505), 391 states have call predecessors, (505), 464 states have return successors, (668), 551 states have call predecessors, (668), 501 states have call successors, (668) [2023-04-02 04:43:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4053 transitions. [2023-04-02 04:43:46,308 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4053 transitions. Word has length 212 [2023-04-02 04:43:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:46,309 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4053 transitions. [2023-04-02 04:43:46,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 6 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2023-04-02 04:43:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4053 transitions. [2023-04-02 04:43:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-04-02 04:43:46,312 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:46,313 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:46,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 04:43:46,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-04-02 04:43:46,521 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:46,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash 525559930, now seen corresponding path program 1 times [2023-04-02 04:43:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:46,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899778810] [2023-04-02 04:43:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:46,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 04:43:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-04-02 04:43:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:43:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:43:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-04-02 04:43:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-04-02 04:43:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-04-02 04:43:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-04-02 04:43:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:43:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-04-02 04:43:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-04-02 04:43:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-04-02 04:43:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-04-02 04:43:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-04-02 04:43:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-04-02 04:43:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-04-02 04:43:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-04-02 04:43:46,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899778810] [2023-04-02 04:43:46,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899778810] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:43:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346917002] [2023-04-02 04:43:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:46,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:46,972 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 04:43:46,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 04:43:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:47,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-02 04:43:47,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:43:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 97 proven. 34 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-04-02 04:43:47,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 04:43:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-04-02 04:43:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346917002] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 04:43:47,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 04:43:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 9] total 24 [2023-04-02 04:43:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33216758] [2023-04-02 04:43:47,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 04:43:47,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-02 04:43:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-02 04:43:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2023-04-02 04:43:47,913 INFO L87 Difference]: Start difference. First operand 3454 states and 4053 transitions. Second operand has 24 states, 24 states have (on average 8.25) internal successors, (198), 14 states have internal predecessors, (198), 8 states have call successors, (74), 17 states have call predecessors, (74), 8 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2023-04-02 04:43:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:51,293 INFO L93 Difference]: Finished difference Result 3957 states and 4822 transitions. [2023-04-02 04:43:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-04-02 04:43:51,294 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.25) internal successors, (198), 14 states have internal predecessors, (198), 8 states have call successors, (74), 17 states have call predecessors, (74), 8 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) Word has length 226 [2023-04-02 04:43:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:51,304 INFO L225 Difference]: With dead ends: 3957 [2023-04-02 04:43:51,305 INFO L226 Difference]: Without dead ends: 3954 [2023-04-02 04:43:51,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 529 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=779, Invalid=3381, Unknown=0, NotChecked=0, Total=4160 [2023-04-02 04:43:51,308 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2416 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3366 mSolverCounterSat, 1041 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 3366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:51,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 49 Invalid, 4407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 3366 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-04-02 04:43:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2023-04-02 04:43:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3521. [2023-04-02 04:43:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3521 states, 2532 states have (on average 1.1587677725118484) internal successors, (2934), 2613 states have internal predecessors, (2934), 518 states have call successors, (518), 403 states have call predecessors, (518), 470 states have return successors, (681), 556 states have call predecessors, (681), 514 states have call successors, (681) [2023-04-02 04:43:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3521 states to 3521 states and 4133 transitions. [2023-04-02 04:43:51,788 INFO L78 Accepts]: Start accepts. Automaton has 3521 states and 4133 transitions. Word has length 226 [2023-04-02 04:43:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:51,789 INFO L495 AbstractCegarLoop]: Abstraction has 3521 states and 4133 transitions. [2023-04-02 04:43:51,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.25) internal successors, (198), 14 states have internal predecessors, (198), 8 states have call successors, (74), 17 states have call predecessors, (74), 8 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2023-04-02 04:43:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3521 states and 4133 transitions. [2023-04-02 04:43:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-04-02 04:43:51,799 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:51,799 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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] [2023-04-02 04:43:51,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 04:43:52,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-04-02 04:43:52,006 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:52,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:52,006 INFO L85 PathProgramCache]: Analyzing trace with hash 396369240, now seen corresponding path program 1 times [2023-04-02 04:43:52,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:52,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874394839] [2023-04-02 04:43:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:52,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 04:43:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-04-02 04:43:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:43:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:43:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-04-02 04:43:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-04-02 04:43:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-04-02 04:43:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-04-02 04:43:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:43:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-04-02 04:43:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-04-02 04:43:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-04-02 04:43:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-04-02 04:43:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-04-02 04:43:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-04-02 04:43:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-04-02 04:43:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:43:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-04-02 04:43:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-04-02 04:43:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-04-02 04:43:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-04-02 04:43:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-04-02 04:43:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-04-02 04:43:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2023-04-02 04:43:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-04-02 04:43:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 99 proven. 27 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2023-04-02 04:43:52,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874394839] [2023-04-02 04:43:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874394839] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:43:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320394462] [2023-04-02 04:43:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:52,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:52,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:52,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 04:43:52,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 04:43:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:52,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-02 04:43:52,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:43:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-04-02 04:43:52,594 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:43:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320394462] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:52,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:43:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 14 [2023-04-02 04:43:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877733045] [2023-04-02 04:43:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:52,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 04:43:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 04:43:52,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:43:52,598 INFO L87 Difference]: Start difference. First operand 3521 states and 4133 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-04-02 04:43:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:53,221 INFO L93 Difference]: Finished difference Result 8624 states and 10208 transitions. [2023-04-02 04:43:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 04:43:53,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 325 [2023-04-02 04:43:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:53,239 INFO L225 Difference]: With dead ends: 8624 [2023-04-02 04:43:53,240 INFO L226 Difference]: Without dead ends: 5519 [2023-04-02 04:43:53,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:43:53,247 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 72 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:53,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 442 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:43:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2023-04-02 04:43:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5418. [2023-04-02 04:43:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5418 states, 3924 states have (on average 1.1541794087665647) internal successors, (4529), 4062 states have internal predecessors, (4529), 797 states have call successors, (797), 611 states have call predecessors, (797), 696 states have return successors, (1042), 832 states have call predecessors, (1042), 793 states have call successors, (1042) [2023-04-02 04:43:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5418 states to 5418 states and 6368 transitions. [2023-04-02 04:43:53,962 INFO L78 Accepts]: Start accepts. Automaton has 5418 states and 6368 transitions. Word has length 325 [2023-04-02 04:43:53,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:53,962 INFO L495 AbstractCegarLoop]: Abstraction has 5418 states and 6368 transitions. [2023-04-02 04:43:53,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-04-02 04:43:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5418 states and 6368 transitions. [2023-04-02 04:43:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-04-02 04:43:53,970 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:53,970 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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] [2023-04-02 04:43:53,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 04:43:54,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:54,178 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:54,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash 822923738, now seen corresponding path program 1 times [2023-04-02 04:43:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:54,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699766856] [2023-04-02 04:43:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:43:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:43:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:43:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:43:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:43:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-04-02 04:43:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-04-02 04:43:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-04-02 04:43:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:43:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:43:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-04-02 04:43:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-04-02 04:43:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-04-02 04:43:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-04-02 04:43:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:43:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-04-02 04:43:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-04-02 04:43:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-04-02 04:43:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-04-02 04:43:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-04-02 04:43:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-04-02 04:43:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-04-02 04:43:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:43:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:43:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:43:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-04-02 04:43:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-04-02 04:43:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-04-02 04:43:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-04-02 04:43:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:43:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-04-02 04:43:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-04-02 04:43:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2023-04-02 04:43:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:43:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-04-02 04:43:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 77 proven. 10 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2023-04-02 04:43:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:43:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699766856] [2023-04-02 04:43:54,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699766856] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:43:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767518135] [2023-04-02 04:43:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:54,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:54,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:43:54,452 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 04:43:54,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 04:43:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:43:54,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 04:43:54,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:43:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-04-02 04:43:54,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:43:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767518135] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:43:54,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:43:54,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2023-04-02 04:43:54,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951332262] [2023-04-02 04:43:54,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:43:54,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 04:43:54,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:43:54,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 04:43:54,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:43:54,745 INFO L87 Difference]: Start difference. First operand 5418 states and 6368 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-04-02 04:43:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:43:55,184 INFO L93 Difference]: Finished difference Result 9515 states and 11209 transitions. [2023-04-02 04:43:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 04:43:55,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 325 [2023-04-02 04:43:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:43:55,201 INFO L225 Difference]: With dead ends: 9515 [2023-04-02 04:43:55,201 INFO L226 Difference]: Without dead ends: 4446 [2023-04-02 04:43:55,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:43:55,213 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 100 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:43:55,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 207 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 04:43:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2023-04-02 04:43:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 4446. [2023-04-02 04:43:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4446 states, 3216 states have (on average 1.1492537313432836) internal successors, (3696), 3332 states have internal predecessors, (3696), 644 states have call successors, (644), 513 states have call predecessors, (644), 585 states have return successors, (820), 671 states have call predecessors, (820), 640 states have call successors, (820) [2023-04-02 04:43:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4446 states to 4446 states and 5160 transitions. [2023-04-02 04:43:55,744 INFO L78 Accepts]: Start accepts. Automaton has 4446 states and 5160 transitions. Word has length 325 [2023-04-02 04:43:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:43:55,745 INFO L495 AbstractCegarLoop]: Abstraction has 4446 states and 5160 transitions. [2023-04-02 04:43:55,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-04-02 04:43:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4446 states and 5160 transitions. [2023-04-02 04:43:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2023-04-02 04:43:55,752 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:43:55,753 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-04-02 04:43:55,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 04:43:55,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:43:55,960 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:43:55,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:43:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash -584514194, now seen corresponding path program 1 times [2023-04-02 04:43:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:43:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116143327] [2023-04-02 04:43:55,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:43:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:43:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:43:55,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 04:43:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:43:56,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 04:43:56,121 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 04:43:56,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 04:43:56,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-04-02 04:43:56,129 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:43:56,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 04:43:56,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 04:43:56 BoogieIcfgContainer [2023-04-02 04:43:56,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 04:43:56,314 INFO L158 Benchmark]: Toolchain (without parser) took 47254.56ms. Allocated memory was 220.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 182.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 612.7MB. Max. memory is 8.0GB. [2023-04-02 04:43:56,314 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 183.5MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 04:43:56,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.41ms. Allocated memory is still 220.2MB. Free memory was 181.7MB in the beginning and 168.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-02 04:43:56,314 INFO L158 Benchmark]: Boogie Preprocessor took 37.32ms. Allocated memory is still 220.2MB. Free memory was 168.6MB in the beginning and 166.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 04:43:56,314 INFO L158 Benchmark]: RCFGBuilder took 554.76ms. Allocated memory is still 220.2MB. Free memory was 166.5MB in the beginning and 146.0MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-04-02 04:43:56,314 INFO L158 Benchmark]: TraceAbstraction took 46379.51ms. Allocated memory was 220.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 145.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 575.0MB. Max. memory is 8.0GB. [2023-04-02 04:43:56,315 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.15ms. Allocated memory is still 183.5MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.41ms. Allocated memory is still 220.2MB. Free memory was 181.7MB in the beginning and 168.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.32ms. Allocated memory is still 220.2MB. Free memory was 168.6MB in the beginning and 166.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 554.76ms. Allocated memory is still 220.2MB. Free memory was 166.5MB in the beginning and 146.0MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 46379.51ms. Allocated memory was 220.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 145.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 575.0MB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, \old(C_1_ev)=67, \old(C_1_i)=82, \old(C_1_pc)=69, \old(C_1_pr)=66, \old(C_1_st)=77, \old(P_1_ev)=71, \old(P_1_i)=79, \old(P_1_pc)=75, \old(P_1_st)=68, \old(data_0)=80, \old(data_1)=73, \old(e)=78, \old(i)=81, \old(max_loop)=72, \old(num)=74, \old(timer)=70, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, count=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L514] CALL init_model() VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L514] RET init_model() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, count=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L515] CALL start_simulation() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] RET init_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L381] CALL, EXPR is_P_1_triggered() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L381] RET, EXPR is_P_1_triggered() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, is_P_1_triggered()=0, max_loop=2, num=0, timer=0] [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L389] RET, EXPR is_C_1_triggered() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, is_C_1_triggered()=0, max_loop=2, num=0, timer=0, tmp=0] [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L448] kernel_st = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, kernel_st=1, max_loop=2, num=0, timer=0] [L449] CALL eval() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=1, __retres1=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___1=1, tmp___2=1] [L311] CALL C_1() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=1, __retres1=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L296] CALL P_1() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L96] CALL write_data(num, 'A') VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(c)=65, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(i___0)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(c)=65, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(i___0)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, c=65, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=0] [L449] RET eval() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=1, max_loop=2, num=1, timer=1] [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] CALL, EXPR is_P_1_triggered() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] RET, EXPR is_P_1_triggered() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, is_P_1_triggered()=0, max_loop=2, num=1, timer=1] [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] RET, EXPR is_C_1_triggered() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, is_C_1_triggered()=0, max_loop=2, num=1, timer=1, tmp=0] [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0] [L467] CALL fire_time_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L467] RET fire_time_events() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0] [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] CALL, EXPR is_P_1_triggered() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=1, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] RET, EXPR is_P_1_triggered() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, is_P_1_triggered()=1, max_loop=2, num=1, timer=1] [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] RET, EXPR is_C_1_triggered() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, is_C_1_triggered()=0, max_loop=2, num=1, timer=1, tmp=1] [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0] [L469] CALL reset_time_events() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] RET reset_time_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0] [L475] CALL, EXPR stop_simulation() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=1, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres2=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1] [L427] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres2=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, stop_simulation()=0, timer=1, tmp=0] [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=0, e=0, i=1, kernel_st=1, max_loop=2, num=1, timer=1, tmp=0, tmp___0=0] [L449] CALL eval() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, \result=1, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___2=1] [L296] CALL P_1() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L96] CALL write_data(num, 'A') VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(c)=65, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(c)=65, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(c)=65, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, timer=1] [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, \result=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=0] [L449] RET eval() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=1, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] CALL, EXPR is_P_1_triggered() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] RET, EXPR is_P_1_triggered() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, is_P_1_triggered()=0, max_loop=2, num=2, timer=1] [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] RET, EXPR is_C_1_triggered() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, is_C_1_triggered()=0, max_loop=2, num=2, timer=1, tmp=0] [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L467] CALL fire_time_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=2, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=2, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=2, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=2, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L467] RET fire_time_events() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] CALL, EXPR is_P_1_triggered() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=1, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] RET, EXPR is_P_1_triggered() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, is_P_1_triggered()=1, max_loop=2, num=2, timer=1] [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] RET, EXPR is_C_1_triggered() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, is_C_1_triggered()=0, max_loop=2, num=2, timer=1, tmp=1] [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] RET reset_time_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L475] CALL, EXPR stop_simulation() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=1, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, __retres2=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1] [L427] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, \result=0, __retres2=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, stop_simulation()=0, timer=1, tmp=0, tmp___0=0] [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(timer)=0, data_0=65, data_1=65, e=0, i=1, kernel_st=1, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L449] CALL eval() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, \result=1, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L296] CALL P_1() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L96] CALL write_data(num, 'A') VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(c)=65, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(c)=65, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(timer)=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(c)=65, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(timer)=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=1, \old(C_1_st)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(data_0)=65, \old(data_1)=65, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(timer)=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 156 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.1s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13517 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13301 mSDsluCounter, 3139 SdHoareTripleChecker+Invalid, 11.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1654 mSDsCounter, 5713 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18654 IncrementalHoareTripleChecker+Invalid, 24367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5713 mSolverCounterUnsat, 1485 mSDtfsCounter, 18654 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3144 GetRequests, 2726 SyntacticMatches, 8 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8033occurred in iteration=12, InterpolantAutomatonStates: 306, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 3647 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 4705 NumberOfCodeBlocks, 4705 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4543 ConstructedInterpolants, 0 QuantifiedInterpolants, 10559 SizeOfPredicates, 10 NumberOfNonLiveVariables, 6857 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 28 InterpolantComputations, 18 PerfectInterpolantSequences, 3543/3680 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:43:56,338 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...