/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:15:17,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:15:17,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:15:17,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:15:17,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:15:17,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:15:17,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:15:17,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:15:17,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:15:17,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:15:17,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:15:17,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:15:17,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:15:17,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:15:17,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:15:17,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:15:17,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:15:17,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:15:17,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:15:17,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:15:17,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:15:17,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:15:17,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:15:17,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:15:17,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:15:17,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:15:17,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:15:17,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:15:17,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:15:17,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:15:17,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:15:17,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:15:17,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:15:17,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:15:17,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:15:17,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:15:17,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:15:17,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:15:17,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:15:17,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:15:17,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:15:17,583 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-11-07 01:15:17,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:15:17,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:15:17,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:15:17,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:15:17,610 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:15:17,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:15:17,610 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:15:17,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:15:17,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:15:17,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:15:17,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:15:17,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:15:17,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:15:17,613 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:15:17,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:15:17,613 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:15:17,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:15:17,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:15:17,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:15:17,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:15:17,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:15:17,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:15:17,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:15:17,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:15:17,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:15:17,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:15:17,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:15:17,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:15:17,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:15:17,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:15:17,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:15:17,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:15:17,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:15:17,958 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:15:17,959 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-11-07 01:15:18,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e01c21b0/80af537c59174651aaa1f23b2899b14f/FLAG1c45e5484 [2019-11-07 01:15:18,485 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:15:18,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2019-11-07 01:15:18,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e01c21b0/80af537c59174651aaa1f23b2899b14f/FLAG1c45e5484 [2019-11-07 01:15:18,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e01c21b0/80af537c59174651aaa1f23b2899b14f [2019-11-07 01:15:18,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:15:18,831 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:15:18,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:15:18,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:15:18,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:15:18,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:15:18" (1/1) ... [2019-11-07 01:15:18,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3891ba11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:18, skipping insertion in model container [2019-11-07 01:15:18,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:15:18" (1/1) ... [2019-11-07 01:15:18,848 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:15:18,884 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:15:19,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:15:19,095 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:15:19,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:15:19,239 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:15:19,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19 WrapperNode [2019-11-07 01:15:19,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:15:19,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:15:19,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:15:19,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:15:19,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (1/1) ... [2019-11-07 01:15:19,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (1/1) ... [2019-11-07 01:15:19,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (1/1) ... [2019-11-07 01:15:19,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (1/1) ... [2019-11-07 01:15:19,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (1/1) ... [2019-11-07 01:15:19,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (1/1) ... [2019-11-07 01:15:19,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (1/1) ... [2019-11-07 01:15:19,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:15:19,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:15:19,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:15:19,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:15:19,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (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-11-07 01:15:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:15:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:15:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-07 01:15:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-07 01:15:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-07 01:15:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-07 01:15:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-07 01:15:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-07 01:15:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-07 01:15:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-07 01:15:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-07 01:15:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-07 01:15:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-07 01:15:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-07 01:15:19,354 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-07 01:15:19,354 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-07 01:15:19,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-07 01:15:19,354 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-07 01:15:19,354 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-07 01:15:19,355 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-07 01:15:19,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:15:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:15:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:15:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-07 01:15:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-07 01:15:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-07 01:15:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-07 01:15:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-07 01:15:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-07 01:15:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-07 01:15:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-07 01:15:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-07 01:15:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-07 01:15:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-07 01:15:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-07 01:15:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-07 01:15:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-07 01:15:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-07 01:15:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-07 01:15:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-07 01:15:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-07 01:15:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:15:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:15:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:15:19,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:15:19,840 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-07 01:15:19,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:19 BoogieIcfgContainer [2019-11-07 01:15:19,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:15:19,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:15:19,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:15:19,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:15:19,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:15:18" (1/3) ... [2019-11-07 01:15:19,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb9a050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:19, skipping insertion in model container [2019-11-07 01:15:19,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:19" (2/3) ... [2019-11-07 01:15:19,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb9a050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:19, skipping insertion in model container [2019-11-07 01:15:19,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:19" (3/3) ... [2019-11-07 01:15:19,851 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-11-07 01:15:19,858 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:15:19,866 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:15:19,875 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:15:19,900 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:15:19,900 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:15:19,900 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:15:19,900 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:15:19,901 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:15:19,901 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:15:19,901 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:15:19,901 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:15:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-11-07 01:15:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-07 01:15:19,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:19,939 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:19,941 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:19,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:19,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1024647557, now seen corresponding path program 1 times [2019-11-07 01:15:19,958 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:19,959 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362660628] [2019-11-07 01:15:19,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:20,286 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362660628] [2019-11-07 01:15:20,287 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:20,288 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:20,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417891562] [2019-11-07 01:15:20,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:20,300 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:20,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:20,315 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 5 states. [2019-11-07 01:15:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:20,924 INFO L93 Difference]: Finished difference Result 286 states and 404 transitions. [2019-11-07 01:15:20,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:20,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-07 01:15:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:20,952 INFO L225 Difference]: With dead ends: 286 [2019-11-07 01:15:20,952 INFO L226 Difference]: Without dead ends: 154 [2019-11-07 01:15:20,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:20,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-07 01:15:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2019-11-07 01:15:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-07 01:15:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2019-11-07 01:15:21,025 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 75 [2019-11-07 01:15:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:21,025 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2019-11-07 01:15:21,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2019-11-07 01:15:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-07 01:15:21,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:21,030 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:21,031 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash -148628551, now seen corresponding path program 1 times [2019-11-07 01:15:21,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:21,032 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234994549] [2019-11-07 01:15:21,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:21,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234994549] [2019-11-07 01:15:21,135 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:21,135 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:21,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144903033] [2019-11-07 01:15:21,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:21,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:21,138 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand 5 states. [2019-11-07 01:15:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:21,549 INFO L93 Difference]: Finished difference Result 265 states and 352 transitions. [2019-11-07 01:15:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:21,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-07 01:15:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:21,553 INFO L225 Difference]: With dead ends: 265 [2019-11-07 01:15:21,553 INFO L226 Difference]: Without dead ends: 154 [2019-11-07 01:15:21,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-07 01:15:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2019-11-07 01:15:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-07 01:15:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2019-11-07 01:15:21,590 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 75 [2019-11-07 01:15:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:21,590 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2019-11-07 01:15:21,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2019-11-07 01:15:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-07 01:15:21,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:21,596 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:21,597 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 295272123, now seen corresponding path program 1 times [2019-11-07 01:15:21,598 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:21,598 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660020255] [2019-11-07 01:15:21,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:21,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660020255] [2019-11-07 01:15:21,769 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:21,770 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:21,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500880171] [2019-11-07 01:15:21,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:21,771 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:21,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:21,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:21,772 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand 4 states. [2019-11-07 01:15:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:21,985 INFO L93 Difference]: Finished difference Result 339 states and 446 transitions. [2019-11-07 01:15:21,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:21,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-07 01:15:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:21,988 INFO L225 Difference]: With dead ends: 339 [2019-11-07 01:15:21,989 INFO L226 Difference]: Without dead ends: 229 [2019-11-07 01:15:21,990 INFO L630 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-11-07 01:15:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-07 01:15:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2019-11-07 01:15:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-07 01:15:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2019-11-07 01:15:22,041 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 75 [2019-11-07 01:15:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:22,041 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2019-11-07 01:15:22,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2019-11-07 01:15:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-07 01:15:22,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:22,047 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:22,048 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash -578205572, now seen corresponding path program 1 times [2019-11-07 01:15:22,048 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:22,049 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889778322] [2019-11-07 01:15:22,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:22,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889778322] [2019-11-07 01:15:22,107 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:22,107 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:22,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134516554] [2019-11-07 01:15:22,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:22,108 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:22,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:22,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:22,108 INFO L87 Difference]: Start difference. First operand 224 states and 284 transitions. Second operand 6 states. [2019-11-07 01:15:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:22,182 INFO L93 Difference]: Finished difference Result 438 states and 566 transitions. [2019-11-07 01:15:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:22,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-11-07 01:15:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:22,186 INFO L225 Difference]: With dead ends: 438 [2019-11-07 01:15:22,186 INFO L226 Difference]: Without dead ends: 234 [2019-11-07 01:15:22,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:15:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-07 01:15:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2019-11-07 01:15:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-07 01:15:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 288 transitions. [2019-11-07 01:15:22,217 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 288 transitions. Word has length 75 [2019-11-07 01:15:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:22,217 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 288 transitions. [2019-11-07 01:15:22,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 288 transitions. [2019-11-07 01:15:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-07 01:15:22,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:22,219 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:22,219 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:22,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:22,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1871394558, now seen corresponding path program 1 times [2019-11-07 01:15:22,220 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:22,220 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127568913] [2019-11-07 01:15:22,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:22,279 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127568913] [2019-11-07 01:15:22,280 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:22,280 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:22,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396608198] [2019-11-07 01:15:22,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:22,281 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:22,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:22,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:22,282 INFO L87 Difference]: Start difference. First operand 229 states and 288 transitions. Second operand 4 states. [2019-11-07 01:15:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:22,552 INFO L93 Difference]: Finished difference Result 633 states and 828 transitions. [2019-11-07 01:15:22,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:22,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-07 01:15:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:22,558 INFO L225 Difference]: With dead ends: 633 [2019-11-07 01:15:22,558 INFO L226 Difference]: Without dead ends: 424 [2019-11-07 01:15:22,560 INFO L630 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-11-07 01:15:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-07 01:15:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-11-07 01:15:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-07 01:15:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 525 transitions. [2019-11-07 01:15:22,617 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 525 transitions. Word has length 75 [2019-11-07 01:15:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:22,618 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 525 transitions. [2019-11-07 01:15:22,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 525 transitions. [2019-11-07 01:15:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-07 01:15:22,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:22,631 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:22,631 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 893913146, now seen corresponding path program 1 times [2019-11-07 01:15:22,632 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:22,632 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307044545] [2019-11-07 01:15:22,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-07 01:15:22,753 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307044545] [2019-11-07 01:15:22,753 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:22,754 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:22,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503948162] [2019-11-07 01:15:22,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:22,755 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:22,756 INFO L87 Difference]: Start difference. First operand 421 states and 525 transitions. Second operand 6 states. [2019-11-07 01:15:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:22,828 INFO L93 Difference]: Finished difference Result 836 states and 1062 transitions. [2019-11-07 01:15:22,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:22,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-07 01:15:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:22,833 INFO L225 Difference]: With dead ends: 836 [2019-11-07 01:15:22,833 INFO L226 Difference]: Without dead ends: 435 [2019-11-07 01:15:22,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:15:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-07 01:15:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-11-07 01:15:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-07 01:15:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 533 transitions. [2019-11-07 01:15:22,874 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 533 transitions. Word has length 93 [2019-11-07 01:15:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:22,874 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 533 transitions. [2019-11-07 01:15:22,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 533 transitions. [2019-11-07 01:15:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-07 01:15:22,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:22,876 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:22,876 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1461892104, now seen corresponding path program 1 times [2019-11-07 01:15:22,877 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:22,877 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754822087] [2019-11-07 01:15:22,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-07 01:15:22,948 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754822087] [2019-11-07 01:15:22,948 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:22,949 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:22,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465876210] [2019-11-07 01:15:22,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:22,950 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:22,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:22,951 INFO L87 Difference]: Start difference. First operand 431 states and 533 transitions. Second operand 5 states. [2019-11-07 01:15:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:23,224 INFO L93 Difference]: Finished difference Result 841 states and 1048 transitions. [2019-11-07 01:15:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:23,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-07 01:15:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:23,228 INFO L225 Difference]: With dead ends: 841 [2019-11-07 01:15:23,229 INFO L226 Difference]: Without dead ends: 431 [2019-11-07 01:15:23,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-07 01:15:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2019-11-07 01:15:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-07 01:15:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 525 transitions. [2019-11-07 01:15:23,261 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 525 transitions. Word has length 93 [2019-11-07 01:15:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:23,262 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 525 transitions. [2019-11-07 01:15:23,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 525 transitions. [2019-11-07 01:15:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-07 01:15:23,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:23,264 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:23,264 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1935681914, now seen corresponding path program 1 times [2019-11-07 01:15:23,264 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:23,265 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69556166] [2019-11-07 01:15:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-07 01:15:23,326 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69556166] [2019-11-07 01:15:23,327 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:23,327 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:23,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024524658] [2019-11-07 01:15:23,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:23,328 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:23,329 INFO L87 Difference]: Start difference. First operand 431 states and 525 transitions. Second operand 5 states. [2019-11-07 01:15:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:23,858 INFO L93 Difference]: Finished difference Result 1036 states and 1305 transitions. [2019-11-07 01:15:23,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:15:23,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-07 01:15:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:23,866 INFO L225 Difference]: With dead ends: 1036 [2019-11-07 01:15:23,866 INFO L226 Difference]: Without dead ends: 626 [2019-11-07 01:15:23,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:15:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-11-07 01:15:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 586. [2019-11-07 01:15:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-07 01:15:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 708 transitions. [2019-11-07 01:15:23,930 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 708 transitions. Word has length 93 [2019-11-07 01:15:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:23,931 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 708 transitions. [2019-11-07 01:15:23,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 708 transitions. [2019-11-07 01:15:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-07 01:15:23,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:23,933 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:23,933 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2111138888, now seen corresponding path program 1 times [2019-11-07 01:15:23,934 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:23,934 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199950700] [2019-11-07 01:15:23,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:15:23,982 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199950700] [2019-11-07 01:15:23,983 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264828154] [2019-11-07 01:15:23,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:24,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:15:24,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:15:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:15:24,125 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:15:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:15:24,193 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:15:24,193 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-11-07 01:15:24,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355974503] [2019-11-07 01:15:24,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:24,195 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:24,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:24,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:24,196 INFO L87 Difference]: Start difference. First operand 586 states and 708 transitions. Second operand 3 states. [2019-11-07 01:15:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:24,300 INFO L93 Difference]: Finished difference Result 1666 states and 2079 transitions. [2019-11-07 01:15:24,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:24,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-07 01:15:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:24,310 INFO L225 Difference]: With dead ends: 1666 [2019-11-07 01:15:24,310 INFO L226 Difference]: Without dead ends: 1103 [2019-11-07 01:15:24,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 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-11-07 01:15:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-11-07 01:15:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1097. [2019-11-07 01:15:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-11-07 01:15:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1353 transitions. [2019-11-07 01:15:24,394 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1353 transitions. Word has length 93 [2019-11-07 01:15:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:24,394 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 1353 transitions. [2019-11-07 01:15:24,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1353 transitions. [2019-11-07 01:15:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-07 01:15:24,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:24,397 INFO L410 BasicCegarLoop]: 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] [2019-11-07 01:15:24,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:24,601 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1397737794, now seen corresponding path program 1 times [2019-11-07 01:15:24,602 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:24,602 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991151981] [2019-11-07 01:15:24,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:15:24,665 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991151981] [2019-11-07 01:15:24,665 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:24,666 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:15:24,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761401190] [2019-11-07 01:15:24,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:24,671 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:24,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:24,672 INFO L87 Difference]: Start difference. First operand 1097 states and 1353 transitions. Second operand 3 states. [2019-11-07 01:15:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:24,809 INFO L93 Difference]: Finished difference Result 3195 states and 3991 transitions. [2019-11-07 01:15:24,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:24,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-07 01:15:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:24,824 INFO L225 Difference]: With dead ends: 3195 [2019-11-07 01:15:24,824 INFO L226 Difference]: Without dead ends: 1608 [2019-11-07 01:15:24,831 INFO L630 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-11-07 01:15:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-11-07 01:15:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2019-11-07 01:15:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-11-07 01:15:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 1984 transitions. [2019-11-07 01:15:24,957 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 1984 transitions. Word has length 95 [2019-11-07 01:15:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:24,958 INFO L462 AbstractCegarLoop]: Abstraction has 1608 states and 1984 transitions. [2019-11-07 01:15:24,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1984 transitions. [2019-11-07 01:15:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-07 01:15:24,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:24,964 INFO L410 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, 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] [2019-11-07 01:15:24,965 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2094315367, now seen corresponding path program 1 times [2019-11-07 01:15:24,965 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:24,965 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242776223] [2019-11-07 01:15:24,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-07 01:15:25,031 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242776223] [2019-11-07 01:15:25,031 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:25,031 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:25,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662391344] [2019-11-07 01:15:25,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:25,032 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:25,033 INFO L87 Difference]: Start difference. First operand 1608 states and 1984 transitions. Second operand 4 states. [2019-11-07 01:15:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:25,201 INFO L93 Difference]: Finished difference Result 2920 states and 3568 transitions. [2019-11-07 01:15:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:25,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-11-07 01:15:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:25,213 INFO L225 Difference]: With dead ends: 2920 [2019-11-07 01:15:25,213 INFO L226 Difference]: Without dead ends: 1335 [2019-11-07 01:15:25,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-11-07 01:15:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-11-07 01:15:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-11-07 01:15:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1613 transitions. [2019-11-07 01:15:25,314 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1613 transitions. Word has length 129 [2019-11-07 01:15:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:25,314 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 1613 transitions. [2019-11-07 01:15:25,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1613 transitions. [2019-11-07 01:15:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-07 01:15:25,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:25,319 INFO L410 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, 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] [2019-11-07 01:15:25,319 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:25,319 INFO L82 PathProgramCache]: Analyzing trace with hash 473506967, now seen corresponding path program 1 times [2019-11-07 01:15:25,319 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:25,320 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560795748] [2019-11-07 01:15:25,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-07 01:15:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-07 01:15:25,428 INFO L172 FreeRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-11-07 01:15:25,429 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-07 01:15:25,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:15:25 BoogieIcfgContainer [2019-11-07 01:15:25,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 01:15:25,543 INFO L168 Benchmark]: Toolchain (without parser) took 6711.55 ms. Allocated memory was 137.9 MB in the beginning and 318.2 MB in the end (delta: 180.4 MB). Free memory was 101.0 MB in the beginning and 168.6 MB in the end (delta: -67.6 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2019-11-07 01:15:25,544 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 01:15:25,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.75 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 100.6 MB in the beginning and 177.3 MB in the end (delta: -76.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-11-07 01:15:25,546 INFO L168 Benchmark]: Boogie Preprocessor took 43.92 ms. Allocated memory is still 200.3 MB. Free memory was 177.3 MB in the beginning and 175.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:15:25,546 INFO L168 Benchmark]: RCFGBuilder took 556.06 ms. Allocated memory is still 200.3 MB. Free memory was 175.4 MB in the beginning and 146.1 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-11-07 01:15:25,547 INFO L168 Benchmark]: TraceAbstraction took 5698.51 ms. Allocated memory was 200.3 MB in the beginning and 318.2 MB in the end (delta: 118.0 MB). Free memory was 145.4 MB in the beginning and 168.6 MB in the end (delta: -23.2 MB). Peak memory consumption was 94.8 MB. Max. memory is 7.1 GB. [2019-11-07 01:15:25,551 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 408.75 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 100.6 MB in the beginning and 177.3 MB in the end (delta: -76.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.92 ms. Allocated memory is still 200.3 MB. Free memory was 177.3 MB in the beginning and 175.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 556.06 ms. Allocated memory is still 200.3 MB. Free memory was 175.4 MB in the beginning and 146.1 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5698.51 ms. Allocated memory was 200.3 MB in the beginning and 318.2 MB in the end (delta: 118.0 MB). Free memory was 145.4 MB in the beginning and 168.6 MB in the end (delta: -23.2 MB). Peak memory consumption was 94.8 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; VAL [\old(E_1)=6, \old(M_E)=11, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=10, \old(t1_pc)=7, \old(t1_st)=4, 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] [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 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] [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 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] [L156] COND TRUE t1_i == 1 [L157] t1_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, 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] 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) 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] [L245] COND FALSE !(T1_E == 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] [L250] COND FALSE !(E_1 == 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] [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); 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, \result=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] [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); 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, \result=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] [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)) 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, tmp___0=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) 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] [L268] COND FALSE !(T1_E == 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] [L273] COND FALSE !(E_1 == 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] [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 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] [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 ; 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] [L169] COND TRUE m_st == 0 [L170] __retres1 = 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, __retres1=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=0] [L182] return (__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, \result=1, __retres1=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=0] [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 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] [L85] t1_pc = 1 [L86] t1_st = 2 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=1, 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 ; 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] [L169] COND TRUE m_st == 0 [L170] __retres1 = 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, __retres1=1, 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] [L182] return (__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, \result=1, __retres1=1, 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] [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 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] [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); 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, \result=0, __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] [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); 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, \result=1, __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] [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 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, tmp=0, tmp___0=1] [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 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] [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, 139 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.6s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2144 SDtfs, 1905 SDslu, 2362 SDs, 0 SdLazy, 1162 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1608occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 113 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 136656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 128/134 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...