java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 17:15:56,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 17:15:56,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 17:15:56,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 17:15:56,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 17:15:56,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 17:15:56,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 17:15:56,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 17:15:56,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 17:15:56,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 17:15:56,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 17:15:56,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 17:15:56,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 17:15:56,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 17:15:56,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 17:15:56,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 17:15:56,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 17:15:56,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 17:15:56,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 17:15:56,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 17:15:56,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 17:15:56,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 17:15:56,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 17:15:56,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 17:15:56,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 17:15:56,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 17:15:56,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 17:15:56,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 17:15:56,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 17:15:56,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 17:15:56,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 17:15:56,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 17:15:56,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 17:15:56,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 17:15:56,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 17:15:56,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 17:15:56,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 17:15:56,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 17:15:56,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 17:15:56,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 17:15:56,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 17:15:56,847 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 [2019-10-07 17:15:56,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 17:15:56,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 17:15:56,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 17:15:56,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 17:15:56,862 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 17:15:56,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 17:15:56,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 17:15:56,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 17:15:56,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 17:15:56,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 17:15:56,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 17:15:56,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 17:15:56,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 17:15:56,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 17:15:56,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 17:15:56,865 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 17:15:56,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 17:15:56,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 17:15:56,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 17:15:56,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 17:15:56,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 17:15:56,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:15:56,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 17:15:56,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 17:15:56,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 17:15:56,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 17:15:56,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 17:15:56,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 17:15:56,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 17:15:57,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 17:15:57,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 17:15:57,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 17:15:57,194 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 17:15:57,194 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 17:15:57,195 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2019-10-07 17:15:57,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb315ee5/586e835e5751431eb5268643ccdf0cdd/FLAG9a09b46b7 [2019-10-07 17:15:57,710 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 17:15:57,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2019-10-07 17:15:57,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb315ee5/586e835e5751431eb5268643ccdf0cdd/FLAG9a09b46b7 [2019-10-07 17:15:58,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb315ee5/586e835e5751431eb5268643ccdf0cdd [2019-10-07 17:15:58,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 17:15:58,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 17:15:58,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 17:15:58,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 17:15:58,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 17:15:58,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fbc93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58, skipping insertion in model container [2019-10-07 17:15:58,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,108 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 17:15:58,137 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 17:15:58,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:15:58,343 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 17:15:58,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:15:58,508 INFO L192 MainTranslator]: Completed translation [2019-10-07 17:15:58,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58 WrapperNode [2019-10-07 17:15:58,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 17:15:58,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 17:15:58,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 17:15:58,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 17:15:58,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (1/1) ... [2019-10-07 17:15:58,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 17:15:58,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 17:15:58,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 17:15:58,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 17:15:58,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:15:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 17:15:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 17:15:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-07 17:15:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-07 17:15:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-07 17:15:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-07 17:15:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-07 17:15:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-07 17:15:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-07 17:15:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-07 17:15:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-07 17:15:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-07 17:15:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-07 17:15:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-07 17:15:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-07 17:15:58,601 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-07 17:15:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-07 17:15:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-07 17:15:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-07 17:15:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-07 17:15:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 17:15:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 17:15:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 17:15:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-07 17:15:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-07 17:15:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-07 17:15:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-07 17:15:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-07 17:15:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-07 17:15:58,605 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-07 17:15:58,605 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-07 17:15:58,605 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-07 17:15:58,605 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-07 17:15:58,605 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-07 17:15:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-07 17:15:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-07 17:15:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-07 17:15:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-07 17:15:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-07 17:15:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-07 17:15:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-07 17:15:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 17:15:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 17:15:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 17:15:59,309 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 17:15:59,309 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-07 17:15:59,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:15:59 BoogieIcfgContainer [2019-10-07 17:15:59,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 17:15:59,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 17:15:59,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 17:15:59,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 17:15:59,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:15:58" (1/3) ... [2019-10-07 17:15:59,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f52525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:15:59, skipping insertion in model container [2019-10-07 17:15:59,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:58" (2/3) ... [2019-10-07 17:15:59,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f52525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:15:59, skipping insertion in model container [2019-10-07 17:15:59,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:15:59" (3/3) ... [2019-10-07 17:15:59,320 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-10-07 17:15:59,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 17:15:59,337 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 17:15:59,348 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 17:15:59,371 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 17:15:59,372 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 17:15:59,372 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 17:15:59,372 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 17:15:59,373 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 17:15:59,373 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 17:15:59,373 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 17:15:59,373 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 17:15:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-10-07 17:15:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 17:15:59,403 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:59,404 INFO L385 BasicCegarLoop]: 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] [2019-10-07 17:15:59,406 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1459852072, now seen corresponding path program 1 times [2019-10-07 17:15:59,421 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:59,422 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:59,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:59,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:15:59,681 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:59,681 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:59,682 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:15:59,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:59,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:59,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:15:59,703 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 4 states. [2019-10-07 17:16:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:00,022 INFO L93 Difference]: Finished difference Result 274 states and 361 transitions. [2019-10-07 17:16:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:00,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-07 17:16:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:00,040 INFO L225 Difference]: With dead ends: 274 [2019-10-07 17:16:00,040 INFO L226 Difference]: Without dead ends: 172 [2019-10-07 17:16:00,045 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-07 17:16:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2019-10-07 17:16:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-07 17:16:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 202 transitions. [2019-10-07 17:16:00,123 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 202 transitions. Word has length 56 [2019-10-07 17:16:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:00,123 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 202 transitions. [2019-10-07 17:16:00,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 202 transitions. [2019-10-07 17:16:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 17:16:00,127 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:00,128 INFO L385 BasicCegarLoop]: 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] [2019-10-07 17:16:00,128 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1258557465, now seen corresponding path program 1 times [2019-10-07 17:16:00,129 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:00,129 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:00,129 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:00,129 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:16:00,254 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:00,255 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:00,255 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:00,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:00,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:00,261 INFO L87 Difference]: Start difference. First operand 168 states and 202 transitions. Second operand 4 states. [2019-10-07 17:16:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:00,487 INFO L93 Difference]: Finished difference Result 462 states and 586 transitions. [2019-10-07 17:16:00,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:00,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-07 17:16:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:00,494 INFO L225 Difference]: With dead ends: 462 [2019-10-07 17:16:00,494 INFO L226 Difference]: Without dead ends: 310 [2019-10-07 17:16:00,497 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-07 17:16:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-10-07 17:16:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-07 17:16:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 363 transitions. [2019-10-07 17:16:00,538 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 363 transitions. Word has length 56 [2019-10-07 17:16:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:00,538 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 363 transitions. [2019-10-07 17:16:00,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 363 transitions. [2019-10-07 17:16:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-07 17:16:00,541 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:00,541 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 17:16:00,541 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash 770625512, now seen corresponding path program 1 times [2019-10-07 17:16:00,542 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:00,542 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:00,543 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:00,543 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:16:00,658 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:00,658 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:00,658 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:00,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:00,660 INFO L87 Difference]: Start difference. First operand 307 states and 363 transitions. Second operand 4 states. [2019-10-07 17:16:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:00,791 INFO L93 Difference]: Finished difference Result 850 states and 1018 transitions. [2019-10-07 17:16:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:00,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-10-07 17:16:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:00,802 INFO L225 Difference]: With dead ends: 850 [2019-10-07 17:16:00,803 INFO L226 Difference]: Without dead ends: 560 [2019-10-07 17:16:00,805 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-07 17:16:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 393. [2019-10-07 17:16:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-07 17:16:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 466 transitions. [2019-10-07 17:16:00,898 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 466 transitions. Word has length 69 [2019-10-07 17:16:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:00,901 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 466 transitions. [2019-10-07 17:16:00,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 466 transitions. [2019-10-07 17:16:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 17:16:00,911 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:00,912 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:00,912 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash 721608716, now seen corresponding path program 1 times [2019-10-07 17:16:00,913 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:00,913 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:00,913 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:00,914 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 17:16:01,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:01,029 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:01,029 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:16:01,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:16:01,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:16:01,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:01,031 INFO L87 Difference]: Start difference. First operand 393 states and 466 transitions. Second operand 3 states. [2019-10-07 17:16:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:01,085 INFO L93 Difference]: Finished difference Result 963 states and 1151 transitions. [2019-10-07 17:16:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:16:01,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-07 17:16:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:01,089 INFO L225 Difference]: With dead ends: 963 [2019-10-07 17:16:01,090 INFO L226 Difference]: Without dead ends: 587 [2019-10-07 17:16:01,091 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-07 17:16:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 493. [2019-10-07 17:16:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-07 17:16:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 586 transitions. [2019-10-07 17:16:01,125 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 586 transitions. Word has length 97 [2019-10-07 17:16:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:01,126 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 586 transitions. [2019-10-07 17:16:01,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:16:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 586 transitions. [2019-10-07 17:16:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-07 17:16:01,128 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:01,128 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:01,128 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:01,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:01,129 INFO L82 PathProgramCache]: Analyzing trace with hash -199930337, now seen corresponding path program 1 times [2019-10-07 17:16:01,129 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:01,129 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:01,129 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:01,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 17:16:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 17:16:01,224 INFO L161 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-10-07 17:16:01,224 INFO L451 BasicCegarLoop]: Counterexample might be feasible [2019-10-07 17:16:01,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 05:16:01 BoogieIcfgContainer [2019-10-07 17:16:01,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 17:16:01,337 INFO L168 Benchmark]: Toolchain (without parser) took 3245.60 ms. Allocated memory was 138.9 MB in the beginning and 244.8 MB in the end (delta: 105.9 MB). Free memory was 103.5 MB in the beginning and 167.4 MB in the end (delta: -64.0 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:01,338 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 17:16:01,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.31 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 103.3 MB in the beginning and 179.3 MB in the end (delta: -76.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:01,340 INFO L168 Benchmark]: Boogie Preprocessor took 38.78 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 177.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:01,341 INFO L168 Benchmark]: RCFGBuilder took 762.25 ms. Allocated memory is still 202.4 MB. Free memory was 177.2 MB in the beginning and 129.5 MB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:01,342 INFO L168 Benchmark]: TraceAbstraction took 2022.74 ms. Allocated memory was 202.4 MB in the beginning and 244.8 MB in the end (delta: 42.5 MB). Free memory was 129.5 MB in the beginning and 167.4 MB in the end (delta: -38.0 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:01,346 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 417.31 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 103.3 MB in the beginning and 179.3 MB in the end (delta: -76.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.78 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 177.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 762.25 ms. Allocated memory is still 202.4 MB. Free memory was 177.2 MB in the beginning and 129.5 MB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2022.74 ms. Allocated memory was 202.4 MB in the beginning and 244.8 MB in the end (delta: 42.5 MB). Free memory was 129.5 MB in the beginning and 167.4 MB in the end (delta: -38.0 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; [L439] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L443] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L354] m_i = 1 [L355] t1_i = 1 [L443] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L444] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L387] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 [L388] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) [L245] COND FALSE !(T1_E == 0) [L250] COND FALSE !(E_1 == 0) [L389] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) [L390] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) [L268] COND FALSE !(T1_E == 1) [L273] COND FALSE !(E_1 == 1) [L391] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 [L397] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L187] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 [L182] return (__retres1); [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 [L85] t1_pc = 1 [L86] t1_st = 2 [L221] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 [L182] return (__retres1); [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L207] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 [L45] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 [L312] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 [L52] m_pc = 1 [L53] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L207] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L91] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 106 locations, 1 error locations. Result: UNSAFE, OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 773 SDtfs, 542 SDslu, 588 SDs, 0 SdLazy, 262 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 268 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 28038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 37/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...