/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 04:52:28,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 04:52:28,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 04:52:28,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 04:52:28,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 04:52:28,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 04:52:28,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 04:52:28,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 04:52:28,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 04:52:28,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 04:52:28,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 04:52:28,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 04:52:28,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 04:52:28,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 04:52:28,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 04:52:28,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 04:52:28,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 04:52:28,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 04:52:28,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 04:52:28,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 04:52:28,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 04:52:28,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 04:52:28,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 04:52:28,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 04:52:28,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 04:52:28,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 04:52:28,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 04:52:28,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 04:52:28,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 04:52:28,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 04:52:28,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 04:52:28,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 04:52:28,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 04:52:28,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 04:52:28,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 04:52:28,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 04:52:28,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 04:52:28,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 04:52:28,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 04:52:28,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 04:52:28,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 04:52:28,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 04:52:28,694 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 04:52:28,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 04:52:28,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 04:52:28,695 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 04:52:28,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 04:52:28,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 04:52:28,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 04:52:28,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 04:52:28,697 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 04:52:28,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 04:52:28,698 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 04:52:28,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 04:52:28,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 04:52:28,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 04:52:28,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 04:52:28,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 04:52:28,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 04:52:28,699 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 04:52:28,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 04:52:28,699 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 04:52:28,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 04:52:28,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 04:52:28,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 04:52:28,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 04:52:28,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:52:28,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 04:52:28,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 04:52:28,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 04:52:28,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 04:52:28,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 04:52:28,700 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 04:52:28,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 04:52:28,701 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 04:52:28,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 04:52:28,701 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 04:52:28,701 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-04-02 04:52:28,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 04:52:28,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 04:52:28,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 04:52:28,974 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 04:52:28,974 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 04:52:28,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2023-04-02 04:52:30,176 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 04:52:30,376 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 04:52:30,377 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2023-04-02 04:52:30,390 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a96d048/7b7bdcc8452846a5ae40629205b188ca/FLAG6532df1d7 [2023-04-02 04:52:30,403 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a96d048/7b7bdcc8452846a5ae40629205b188ca [2023-04-02 04:52:30,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 04:52:30,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 04:52:30,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 04:52:30,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 04:52:30,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 04:52:30,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ffe772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30, skipping insertion in model container [2023-04-02 04:52:30,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 04:52:30,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 04:52:30,584 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2023-04-02 04:52:30,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:52:30,665 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 04:52:30,676 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2023-04-02 04:52:30,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:52:30,729 INFO L208 MainTranslator]: Completed translation [2023-04-02 04:52:30,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30 WrapperNode [2023-04-02 04:52:30,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 04:52:30,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 04:52:30,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 04:52:30,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 04:52:30,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,773 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 04:52:30,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 04:52:30,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 04:52:30,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 04:52:30,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (1/1) ... [2023-04-02 04:52:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:52:30,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:52:30,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 04:52:30,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 04:52:30,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 04:52:30,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 04:52:30,847 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 04:52:30,847 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-04-02 04:52:30,847 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2023-04-02 04:52:30,847 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2023-04-02 04:52:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2023-04-02 04:52:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2023-04-02 04:52:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-04-02 04:52:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-04-02 04:52:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-04-02 04:52:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-04-02 04:52:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-04-02 04:52:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-04-02 04:52:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-04-02 04:52:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-04-02 04:52:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-04-02 04:52:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-04-02 04:52:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-04-02 04:52:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-04-02 04:52:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-04-02 04:52:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 04:52:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure master [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2023-04-02 04:52:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-04-02 04:52:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-04-02 04:52:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-04-02 04:52:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-04-02 04:52:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-04-02 04:52:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-04-02 04:52:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-04-02 04:52:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-04-02 04:52:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 04:52:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 04:52:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 04:52:30,920 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 04:52:30,923 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 04:52:31,221 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 04:52:31,233 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 04:52:31,233 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-04-02 04:52:31,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:52:31 BoogieIcfgContainer [2023-04-02 04:52:31,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 04:52:31,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 04:52:31,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 04:52:31,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 04:52:31,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 04:52:30" (1/3) ... [2023-04-02 04:52:31,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f8852c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:52:31, skipping insertion in model container [2023-04-02 04:52:31,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:30" (2/3) ... [2023-04-02 04:52:31,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f8852c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:52:31, skipping insertion in model container [2023-04-02 04:52:31,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:52:31" (3/3) ... [2023-04-02 04:52:31,246 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2023-04-02 04:52:31,258 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 04:52:31,258 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 04:52:31,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 04:52:31,336 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;@4b2a0099, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 04:52:31,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 04:52:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 95 states have internal predecessors, (131), 28 states have call successors, (28), 20 states have call predecessors, (28), 20 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-04-02 04:52:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-04-02 04:52:31,351 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:31,351 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] [2023-04-02 04:52:31,351 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:31,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:31,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1621047084, now seen corresponding path program 1 times [2023-04-02 04:52:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:31,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218565804] [2023-04-02 04:52:31,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:31,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:31,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:31,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218565804] [2023-04-02 04:52:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218565804] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:32,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:32,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:52:32,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14240663] [2023-04-02 04:52:32,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:32,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:52:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:32,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:52:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:52:32,070 INFO L87 Difference]: Start difference. First operand has 139 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 95 states have internal predecessors, (131), 28 states have call successors, (28), 20 states have call predecessors, (28), 20 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:52:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:33,405 INFO L93 Difference]: Finished difference Result 483 states and 729 transitions. [2023-04-02 04:52:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 04:52:33,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2023-04-02 04:52:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:33,432 INFO L225 Difference]: With dead ends: 483 [2023-04-02 04:52:33,432 INFO L226 Difference]: Without dead ends: 344 [2023-04-02 04:52:33,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-04-02 04:52:33,442 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 689 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:33,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 55 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:52:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-04-02 04:52:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 233. [2023-04-02 04:52:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 158 states have (on average 1.3544303797468353) internal successors, (214), 166 states have internal predecessors, (214), 43 states have call successors, (43), 32 states have call predecessors, (43), 31 states have return successors, (44), 41 states have call predecessors, (44), 40 states have call successors, (44) [2023-04-02 04:52:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 301 transitions. [2023-04-02 04:52:33,528 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 301 transitions. Word has length 75 [2023-04-02 04:52:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:33,528 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 301 transitions. [2023-04-02 04:52:33,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:52:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 301 transitions. [2023-04-02 04:52:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-04-02 04:52:33,531 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:33,531 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] [2023-04-02 04:52:33,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 04:52:33,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:33,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1556466159, now seen corresponding path program 1 times [2023-04-02 04:52:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:33,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450158736] [2023-04-02 04:52:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:33,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:33,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450158736] [2023-04-02 04:52:33,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450158736] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:33,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:33,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:33,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530688433] [2023-04-02 04:52:33,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:33,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:33,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:33,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:33,823 INFO L87 Difference]: Start difference. First operand 233 states and 301 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:52:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:34,499 INFO L93 Difference]: Finished difference Result 547 states and 750 transitions. [2023-04-02 04:52:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 04:52:34,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2023-04-02 04:52:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:34,503 INFO L225 Difference]: With dead ends: 547 [2023-04-02 04:52:34,503 INFO L226 Difference]: Without dead ends: 333 [2023-04-02 04:52:34,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-04-02 04:52:34,505 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 488 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:34,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 17 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 04:52:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-04-02 04:52:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2023-04-02 04:52:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 158 states have (on average 1.3101265822784811) internal successors, (207), 166 states have internal predecessors, (207), 43 states have call successors, (43), 32 states have call predecessors, (43), 31 states have return successors, (44), 41 states have call predecessors, (44), 40 states have call successors, (44) [2023-04-02 04:52:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 294 transitions. [2023-04-02 04:52:34,580 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 294 transitions. Word has length 75 [2023-04-02 04:52:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:34,580 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 294 transitions. [2023-04-02 04:52:34,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:52:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 294 transitions. [2023-04-02 04:52:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-04-02 04:52:34,582 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:34,582 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] [2023-04-02 04:52:34,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 04:52:34,582 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:34,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash -972016875, now seen corresponding path program 1 times [2023-04-02 04:52:34,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:34,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525886171] [2023-04-02 04:52:34,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:34,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:34,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525886171] [2023-04-02 04:52:34,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525886171] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:34,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:34,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:34,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324533943] [2023-04-02 04:52:34,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:34,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:34,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:34,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:34,770 INFO L87 Difference]: Start difference. First operand 233 states and 294 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:52:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:35,655 INFO L93 Difference]: Finished difference Result 550 states and 743 transitions. [2023-04-02 04:52:35,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:52:35,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2023-04-02 04:52:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:35,660 INFO L225 Difference]: With dead ends: 550 [2023-04-02 04:52:35,660 INFO L226 Difference]: Without dead ends: 337 [2023-04-02 04:52:35,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-04-02 04:52:35,667 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 309 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:35,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 36 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 04:52:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-04-02 04:52:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 238. [2023-04-02 04:52:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 170 states have internal predecessors, (210), 43 states have call successors, (43), 32 states have call predecessors, (43), 32 states have return successors, (45), 42 states have call predecessors, (45), 40 states have call successors, (45) [2023-04-02 04:52:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 298 transitions. [2023-04-02 04:52:35,723 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 298 transitions. Word has length 75 [2023-04-02 04:52:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:35,723 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 298 transitions. [2023-04-02 04:52:35,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:52:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 298 transitions. [2023-04-02 04:52:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-04-02 04:52:35,725 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:35,725 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] [2023-04-02 04:52:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 04:52:35,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:35,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1477583255, now seen corresponding path program 1 times [2023-04-02 04:52:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496361218] [2023-04-02 04:52:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:35,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496361218] [2023-04-02 04:52:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496361218] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:35,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445366428] [2023-04-02 04:52:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:35,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:35,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:35,925 INFO L87 Difference]: Start difference. First operand 238 states and 298 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:52:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:36,877 INFO L93 Difference]: Finished difference Result 567 states and 761 transitions. [2023-04-02 04:52:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 04:52:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2023-04-02 04:52:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:36,882 INFO L225 Difference]: With dead ends: 567 [2023-04-02 04:52:36,883 INFO L226 Difference]: Without dead ends: 349 [2023-04-02 04:52:36,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:52:36,891 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 391 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:36,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 36 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:52:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-04-02 04:52:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 248. [2023-04-02 04:52:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 178 states have internal predecessors, (218), 43 states have call successors, (43), 32 states have call predecessors, (43), 34 states have return successors, (47), 44 states have call predecessors, (47), 40 states have call successors, (47) [2023-04-02 04:52:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 308 transitions. [2023-04-02 04:52:36,944 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 308 transitions. Word has length 75 [2023-04-02 04:52:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:36,946 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 308 transitions. [2023-04-02 04:52:36,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:52:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 308 transitions. [2023-04-02 04:52:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-04-02 04:52:36,951 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:36,951 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] [2023-04-02 04:52:36,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 04:52:36,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:36,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1500215509, now seen corresponding path program 1 times [2023-04-02 04:52:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:36,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808184108] [2023-04-02 04:52:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:36,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808184108] [2023-04-02 04:52:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808184108] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:37,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:37,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151307902] [2023-04-02 04:52:37,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:37,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:37,159 INFO L87 Difference]: Start difference. First operand 248 states and 308 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:52:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:38,055 INFO L93 Difference]: Finished difference Result 698 states and 923 transitions. [2023-04-02 04:52:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-02 04:52:38,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2023-04-02 04:52:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:38,059 INFO L225 Difference]: With dead ends: 698 [2023-04-02 04:52:38,059 INFO L226 Difference]: Without dead ends: 469 [2023-04-02 04:52:38,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2023-04-02 04:52:38,061 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 695 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:38,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 16 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 04:52:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2023-04-02 04:52:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 299. [2023-04-02 04:52:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 210 states have (on average 1.223809523809524) internal successors, (257), 218 states have internal predecessors, (257), 47 states have call successors, (47), 38 states have call predecessors, (47), 41 states have return successors, (50), 49 states have call predecessors, (50), 44 states have call successors, (50) [2023-04-02 04:52:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 354 transitions. [2023-04-02 04:52:38,099 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 354 transitions. Word has length 75 [2023-04-02 04:52:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:38,099 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 354 transitions. [2023-04-02 04:52:38,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:52:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 354 transitions. [2023-04-02 04:52:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-04-02 04:52:38,100 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:38,100 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] [2023-04-02 04:52:38,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 04:52:38,101 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:38,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1366202003, now seen corresponding path program 1 times [2023-04-02 04:52:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:38,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38005513] [2023-04-02 04:52:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38005513] [2023-04-02 04:52:38,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38005513] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:52:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937824733] [2023-04-02 04:52:38,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:38,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:52:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:52:38,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:52:38,257 INFO L87 Difference]: Start difference. First operand 299 states and 354 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:52:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:39,156 INFO L93 Difference]: Finished difference Result 1030 states and 1387 transitions. [2023-04-02 04:52:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-02 04:52:39,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2023-04-02 04:52:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:39,162 INFO L225 Difference]: With dead ends: 1030 [2023-04-02 04:52:39,162 INFO L226 Difference]: Without dead ends: 752 [2023-04-02 04:52:39,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:52:39,165 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1112 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:39,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 12 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:52:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2023-04-02 04:52:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 512. [2023-04-02 04:52:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 359 states have (on average 1.2200557103064067) internal successors, (438), 378 states have internal predecessors, (438), 82 states have call successors, (82), 60 states have call predecessors, (82), 70 states have return successors, (107), 87 states have call predecessors, (107), 79 states have call successors, (107) [2023-04-02 04:52:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 627 transitions. [2023-04-02 04:52:39,259 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 627 transitions. Word has length 75 [2023-04-02 04:52:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:39,261 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 627 transitions. [2023-04-02 04:52:39,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:52:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 627 transitions. [2023-04-02 04:52:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-04-02 04:52:39,266 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:39,266 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] [2023-04-02 04:52:39,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 04:52:39,267 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:39,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:39,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1279127601, now seen corresponding path program 1 times [2023-04-02 04:52:39,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:39,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459476151] [2023-04-02 04:52:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459476151] [2023-04-02 04:52:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459476151] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:39,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:39,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 04:52:39,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269384432] [2023-04-02 04:52:39,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:39,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 04:52:39,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 04:52:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-02 04:52:39,403 INFO L87 Difference]: Start difference. First operand 512 states and 627 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:52:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:40,217 INFO L93 Difference]: Finished difference Result 1734 states and 2313 transitions. [2023-04-02 04:52:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:52:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2023-04-02 04:52:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:40,225 INFO L225 Difference]: With dead ends: 1734 [2023-04-02 04:52:40,225 INFO L226 Difference]: Without dead ends: 1247 [2023-04-02 04:52:40,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:52:40,228 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 805 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:40,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 13 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 04:52:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-04-02 04:52:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 996. [2023-04-02 04:52:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 706 states have (on average 1.2167138810198301) internal successors, (859), 742 states have internal predecessors, (859), 155 states have call successors, (155), 114 states have call predecessors, (155), 134 states have return successors, (223), 159 states have call predecessors, (223), 152 states have call successors, (223) [2023-04-02 04:52:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1237 transitions. [2023-04-02 04:52:40,357 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1237 transitions. Word has length 76 [2023-04-02 04:52:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:40,357 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1237 transitions. [2023-04-02 04:52:40,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-02 04:52:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1237 transitions. [2023-04-02 04:52:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-04-02 04:52:40,359 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:40,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:52:40,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-02 04:52:40,360 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:40,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1572428728, now seen corresponding path program 1 times [2023-04-02 04:52:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592931742] [2023-04-02 04:52:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:40,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-04-02 04:52:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-04-02 04:52:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 04:52:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592931742] [2023-04-02 04:52:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592931742] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:40,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:52:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170669814] [2023-04-02 04:52:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:40,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:52:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:52:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:52:40,523 INFO L87 Difference]: Start difference. First operand 996 states and 1237 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:41,293 INFO L93 Difference]: Finished difference Result 2299 states and 3009 transitions. [2023-04-02 04:52:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:52:41,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 95 [2023-04-02 04:52:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:41,302 INFO L225 Difference]: With dead ends: 2299 [2023-04-02 04:52:41,302 INFO L226 Difference]: Without dead ends: 1324 [2023-04-02 04:52:41,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-04-02 04:52:41,306 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 758 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:41,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 16 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 04:52:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2023-04-02 04:52:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1028. [2023-04-02 04:52:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 730 states have (on average 1.2178082191780821) internal successors, (889), 771 states have internal predecessors, (889), 156 states have call successors, (156), 114 states have call predecessors, (156), 141 states have return successors, (237), 163 states have call predecessors, (237), 153 states have call successors, (237) [2023-04-02 04:52:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1282 transitions. [2023-04-02 04:52:41,466 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1282 transitions. Word has length 95 [2023-04-02 04:52:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:41,467 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 1282 transitions. [2023-04-02 04:52:41,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-02 04:52:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1282 transitions. [2023-04-02 04:52:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-04-02 04:52:41,468 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:41,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:52:41,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-02 04:52:41,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:41,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:41,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1332188982, now seen corresponding path program 1 times [2023-04-02 04:52:41,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:41,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642256190] [2023-04-02 04:52:41,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:41,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-02 04:52:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:52:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:52:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:52:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-04-02 04:52:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-04-02 04:52:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 04:52:41,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:41,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642256190] [2023-04-02 04:52:41,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642256190] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:41,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:41,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:41,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825833893] [2023-04-02 04:52:41,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:41,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:41,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:41,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:41,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:41,619 INFO L87 Difference]: Start difference. First operand 1028 states and 1282 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:44,312 INFO L93 Difference]: Finished difference Result 4589 states and 6330 transitions. [2023-04-02 04:52:44,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-04-02 04:52:44,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 95 [2023-04-02 04:52:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:44,325 INFO L225 Difference]: With dead ends: 4589 [2023-04-02 04:52:44,326 INFO L226 Difference]: Without dead ends: 2475 [2023-04-02 04:52:44,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=491, Invalid=1489, Unknown=0, NotChecked=0, Total=1980 [2023-04-02 04:52:44,338 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2073 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 1073 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1073 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:44,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2100 Valid, 22 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1073 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-04-02 04:52:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2023-04-02 04:52:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2122. [2023-04-02 04:52:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 1518 states have (on average 1.2015810276679841) internal successors, (1824), 1617 states have internal predecessors, (1824), 320 states have call successors, (320), 214 states have call predecessors, (320), 283 states have return successors, (621), 337 states have call predecessors, (621), 317 states have call successors, (621) [2023-04-02 04:52:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2765 transitions. [2023-04-02 04:52:44,701 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2765 transitions. Word has length 95 [2023-04-02 04:52:44,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:44,702 INFO L495 AbstractCegarLoop]: Abstraction has 2122 states and 2765 transitions. [2023-04-02 04:52:44,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2765 transitions. [2023-04-02 04:52:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-04-02 04:52:44,706 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:44,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:52:44,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-04-02 04:52:44,706 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:44,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2099556859, now seen corresponding path program 1 times [2023-04-02 04:52:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:44,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316009785] [2023-04-02 04:52:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:52:44,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 04:52:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:52:44,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 04:52:44,772 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 04:52:44,773 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 04:52:44,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-02 04:52:44,777 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:52:44,780 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 04:52:44,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 04:52:44 BoogieIcfgContainer [2023-04-02 04:52:44,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 04:52:44,858 INFO L158 Benchmark]: Toolchain (without parser) took 14451.03ms. Allocated memory was 179.3MB in the beginning and 471.9MB in the end (delta: 292.6MB). Free memory was 129.3MB in the beginning and 405.5MB in the end (delta: -276.2MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2023-04-02 04:52:44,858 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 179.3MB. Free memory was 133.3MB in the beginning and 133.1MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 04:52:44,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.98ms. Allocated memory is still 179.3MB. Free memory was 129.0MB in the beginning and 116.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-02 04:52:44,858 INFO L158 Benchmark]: Boogie Preprocessor took 45.71ms. Allocated memory is still 179.3MB. Free memory was 116.6MB in the beginning and 114.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 04:52:44,859 INFO L158 Benchmark]: RCFGBuilder took 457.99ms. Allocated memory is still 179.3MB. Free memory was 114.7MB in the beginning and 96.2MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-04-02 04:52:44,859 INFO L158 Benchmark]: TraceAbstraction took 13619.98ms. Allocated memory was 179.3MB in the beginning and 471.9MB in the end (delta: 292.6MB). Free memory was 95.5MB in the beginning and 405.5MB in the end (delta: -310.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 04:52:44,860 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 179.3MB. Free memory was 133.3MB in the beginning and 133.1MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.98ms. Allocated memory is still 179.3MB. Free memory was 129.0MB in the beginning and 116.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.71ms. Allocated memory is still 179.3MB. Free memory was 116.6MB in the beginning and 114.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 457.99ms. Allocated memory is still 179.3MB. Free memory was 114.7MB in the beginning and 96.2MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13619.98ms. Allocated memory was 179.3MB in the beginning and 471.9MB in the end (delta: 292.6MB). Free memory was 95.5MB in the beginning and 405.5MB in the end (delta: -310.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=56, \old(M_E)=52, \old(T1_E)=50, \old(m_i)=54, \old(m_pc)=58, \old(m_st)=59, \old(t1_i)=51, \old(t1_pc)=53, \old(t1_st)=57, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0] [L449] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0] [L453] CALL init_model() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0] [L364] m_i = 1 [L365] t1_i = 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L453] RET init_model() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L454] CALL start_simulation() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L399] CALL fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L298] CALL, EXPR is_master_triggered() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L112] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_master_triggered() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, is_master_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L131] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L306] RET, EXPR is_transmit1_triggered() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, is_transmit1_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L400] RET activate_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L407] kernel_st = 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, kernel_st=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L408] CALL eval() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L197] int tmp ; VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L231] CALL transmit1() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L231] RET transmit1() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L217] CALL master() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L55] E_1 = 1 VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L56] CALL immediate_notify() VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L322] CALL activate_threads() VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L298] CALL, EXPR is_master_triggered() VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L112] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_master_triggered() VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, is_master_triggered()=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L131] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L306] RET, EXPR is_transmit1_triggered() VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, is_transmit1_triggered()=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L322] RET activate_threads() VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() VAL [E_1=1, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L57] E_1 = 2 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET master() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L231] CALL transmit1() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L101] CALL error() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L21] reach_error() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7471 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7320 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 3582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7565 IncrementalHoareTripleChecker+Invalid, 11147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3582 mSolverCounterUnsat, 62 mSDtfsCounter, 7565 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2122occurred in iteration=9, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1721 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 1688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 30/30 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:52:44,875 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...