./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59598ef74ac7afb6c962e2cc2ba26af488759b7c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:44:20,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:44:20,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:44:20,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:44:20,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:44:20,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:44:20,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:44:20,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:44:20,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:44:20,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:44:20,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:44:20,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:44:20,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:44:20,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:44:20,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:44:20,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:44:20,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:44:20,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:44:20,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:44:20,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:44:20,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:44:20,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:44:20,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:44:20,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:44:20,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:44:20,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:44:20,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:44:20,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:44:20,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:44:20,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:44:20,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:44:20,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:44:20,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:44:20,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:44:20,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:44:20,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:44:20,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:44:20,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:44:20,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:44:20,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:44:20,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:44:20,862 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-19 22:44:20,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:44:20,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:44:20,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-19 22:44:20,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-19 22:44:20,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:44:20,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:44:20,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:44:20,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:44:20,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:44:20,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:44:20,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:44:20,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:44:20,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:44:20,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:44:20,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:44:20,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:44:20,896 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:44:20,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:44:20,897 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-19 22:44:20,897 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-19 22:44:20,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:44:20,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:44:20,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-19 22:44:20,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:44:20,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:44:20,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:44:20,898 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-19 22:44:20,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:44:20,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:44:20,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-11-19 22:44:21,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:44:21,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:44:21,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:44:21,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:44:21,124 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:44:21,125 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-19 22:44:21,199 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/data/eb923c5e9/0cf73fab67fc4c6498aa8051e43b758b/FLAG1b8e24959 [2019-11-19 22:44:21,693 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:44:21,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-19 22:44:21,708 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/data/eb923c5e9/0cf73fab67fc4c6498aa8051e43b758b/FLAG1b8e24959 [2019-11-19 22:44:21,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/data/eb923c5e9/0cf73fab67fc4c6498aa8051e43b758b [2019-11-19 22:44:21,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:44:21,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:44:21,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:44:21,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:44:21,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:44:21,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:44:21" (1/1) ... [2019-11-19 22:44:21,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e95bc24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:21, skipping insertion in model container [2019-11-19 22:44:21,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:44:21" (1/1) ... [2019-11-19 22:44:22,002 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:44:22,056 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:44:22,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:44:22,433 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:44:22,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:44:22,497 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:44:22,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22 WrapperNode [2019-11-19 22:44:22,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:44:22,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:44:22,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:44:22,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:44:22,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:44:22,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:44:22,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:44:22,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:44:22,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... [2019-11-19 22:44:22,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:44:22,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:44:22,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:44:22,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:44:22,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-11-19 22:44:22,675 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-19 22:44:22,675 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-19 22:44:22,676 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-19 22:44:22,676 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-19 22:44:22,676 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-19 22:44:22,676 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-19 22:44:22,676 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-19 22:44:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-19 22:44:22,677 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-19 22:44:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-19 22:44:22,677 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-19 22:44:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-19 22:44:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-19 22:44:22,678 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-19 22:44:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:44:22,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:44:23,492 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:44:23,492 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-19 22:44:23,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:44:23 BoogieIcfgContainer [2019-11-19 22:44:23,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:44:23,494 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-19 22:44:23,494 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-19 22:44:23,507 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-19 22:44:23,507 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:44:23" (1/1) ... [2019-11-19 22:44:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:44:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 72 states and 103 transitions. [2019-11-19 22:44:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 103 transitions. [2019-11-19 22:44:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 22:44:23,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:23,797 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-19 22:44:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 76 states and 109 transitions. [2019-11-19 22:44:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2019-11-19 22:44:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 22:44:24,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:24,201 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-19 22:44:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 77 states and 109 transitions. [2019-11-19 22:44:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-11-19 22:44:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 22:44:24,486 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:24,612 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-19 22:44:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 85 states and 124 transitions. [2019-11-19 22:44:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2019-11-19 22:44:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 22:44:24,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:44:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 91 states and 137 transitions. [2019-11-19 22:44:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 137 transitions. [2019-11-19 22:44:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 22:44:25,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:44:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 92 states and 139 transitions. [2019-11-19 22:44:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2019-11-19 22:44:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 22:44:25,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 22:44:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 93 states and 140 transitions. [2019-11-19 22:44:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2019-11-19 22:44:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 22:44:25,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 22:44:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 94 states and 141 transitions. [2019-11-19 22:44:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2019-11-19 22:44:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 22:44:25,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:44:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 96 states and 146 transitions. [2019-11-19 22:44:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2019-11-19 22:44:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 22:44:26,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:44:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 105 states and 168 transitions. [2019-11-19 22:44:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 168 transitions. [2019-11-19 22:44:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 22:44:26,420 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 22:44:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 107 states and 172 transitions. [2019-11-19 22:44:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2019-11-19 22:44:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-19 22:44:26,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:44:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 108 states and 174 transitions. [2019-11-19 22:44:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 174 transitions. [2019-11-19 22:44:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-19 22:44:26,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:44:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 111 states and 176 transitions. [2019-11-19 22:44:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 176 transitions. [2019-11-19 22:44:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 22:44:26,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 22:44:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 117 states and 191 transitions. [2019-11-19 22:44:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2019-11-19 22:44:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 22:44:27,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:44:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 122 states and 198 transitions. [2019-11-19 22:44:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 198 transitions. [2019-11-19 22:44:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 22:44:27,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 22:44:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 127 states and 211 transitions. [2019-11-19 22:44:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 211 transitions. [2019-11-19 22:44:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 22:44:28,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 22:44:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 132 states and 219 transitions. [2019-11-19 22:44:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 219 transitions. [2019-11-19 22:44:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 22:44:28,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 22:44:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 134 states and 221 transitions. [2019-11-19 22:44:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 221 transitions. [2019-11-19 22:44:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 22:44:28,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 22:44:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 136 states and 226 transitions. [2019-11-19 22:44:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 226 transitions. [2019-11-19 22:44:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 22:44:29,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 22:44:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 146 states and 245 transitions. [2019-11-19 22:44:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 245 transitions. [2019-11-19 22:44:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 22:44:29,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 22:44:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 147 states and 245 transitions. [2019-11-19 22:44:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 245 transitions. [2019-11-19 22:44:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 22:44:29,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 22:44:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 151 states and 254 transitions. [2019-11-19 22:44:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 254 transitions. [2019-11-19 22:44:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 22:44:29,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:44:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 162 states and 281 transitions. [2019-11-19 22:44:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 281 transitions. [2019-11-19 22:44:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 22:44:31,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:44:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 165 states and 287 transitions. [2019-11-19 22:44:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2019-11-19 22:44:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 22:44:31,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:44:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 165 states and 287 transitions. [2019-11-19 22:44:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2019-11-19 22:44:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 22:44:31,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:44:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 170 states and 304 transitions. [2019-11-19 22:44:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 304 transitions. [2019-11-19 22:44:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-19 22:44:32,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-19 22:44:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 175 states and 315 transitions. [2019-11-19 22:44:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 315 transitions. [2019-11-19 22:44:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-19 22:44:32,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 22:44:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 188 states and 336 transitions. [2019-11-19 22:44:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 336 transitions. [2019-11-19 22:44:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 22:44:32,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 22:44:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 190 states and 339 transitions. [2019-11-19 22:44:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 339 transitions. [2019-11-19 22:44:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 22:44:33,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-19 22:44:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 195 states and 346 transitions. [2019-11-19 22:44:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 346 transitions. [2019-11-19 22:44:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 22:44:33,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-19 22:44:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 195 states and 346 transitions. [2019-11-19 22:44:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 346 transitions. [2019-11-19 22:44:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 22:44:33,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 22:44:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 204 states and 372 transitions. [2019-11-19 22:44:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 372 transitions. [2019-11-19 22:44:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 22:44:34,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:44:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 204 states and 372 transitions. [2019-11-19 22:44:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 372 transitions. [2019-11-19 22:44:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 22:44:34,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 22:44:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 221 states and 426 transitions. [2019-11-19 22:44:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 426 transitions. [2019-11-19 22:44:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-19 22:44:36,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-19 22:44:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 221 states and 426 transitions. [2019-11-19 22:44:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 426 transitions. [2019-11-19 22:44:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-19 22:44:37,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-19 22:44:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 226 states and 436 transitions. [2019-11-19 22:44:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 436 transitions. [2019-11-19 22:44:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-19 22:44:38,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-19 22:44:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 22:44:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 226 states and 436 transitions. [2019-11-19 22:44:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 436 transitions. [2019-11-19 22:44:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-19 22:44:38,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 22:44:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:44:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:44:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:44:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:44:38,641 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 37 iterations. [2019-11-19 22:44:38,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 19.11 10:44:38 ImpRootNode [2019-11-19 22:44:38,797 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-19 22:44:38,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:44:38,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:44:38,798 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:44:38,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:44:23" (3/4) ... [2019-11-19 22:44:38,801 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 22:44:38,948 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b027c741-85cb-4000-b283-89e6096985bf/bin/ukojak/witness.graphml [2019-11-19 22:44:38,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:44:38,951 INFO L168 Benchmark]: Toolchain (without parser) took 16966.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 948.7 MB in the beginning and 914.8 MB in the end (delta: 33.9 MB). Peak memory consumption was 336.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:38,951 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:44:38,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:38,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:38,952 INFO L168 Benchmark]: Boogie Preprocessor took 33.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:44:38,953 INFO L168 Benchmark]: RCFGBuilder took 900.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:38,953 INFO L168 Benchmark]: CodeCheck took 15303.16 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.0 GB in the beginning and 927.5 MB in the end (delta: 115.0 MB). Peak memory consumption was 308.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:38,954 INFO L168 Benchmark]: Witness Printer took 150.90 ms. Allocated memory is still 1.3 GB. Free memory was 927.5 MB in the beginning and 914.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:38,956 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 8 procedures, 72 locations, 1 error locations. Result: UNSAFE, OverallTime: 15.1s, OverallIterations: 37, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -404465696 SDtfs, -2035793440 SDslu, -1696436696 SDs, 0 SdLazy, 946510116 SolverSat, -42304988 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20429 GetRequests, 19164 SyntacticMatches, 1071 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45787 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2353 NumberOfCodeBlocks, 2353 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2226 ConstructedInterpolants, 0 QuantifiedInterpolants, 235973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 29 PerfectInterpolantSequences, 942/975 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [E_1=2, E_M=2, local=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, token=0] [L423] FCALL update_channels() VAL [E_1=2, E_M=2, local=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, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [E_1=2, E_M=2, local=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, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=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, token=0] [L261] COND FALSE !(M_E == 0) [L266] COND FALSE !(T1_E == 0) [L271] COND FALSE !(E_M == 0) [L276] COND FALSE !(E_1 == 0) [L425] RET fire_delta_events() VAL [E_1=2, E_M=2, local=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, token=0] [L426] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=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, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=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, token=0] [L136] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=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, token=0] [L138] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [L142] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=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, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=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, token=0] [L155] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=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, token=0] [L157] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) [L426] RET activate_threads() VAL [E_1=2, E_M=2, local=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, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=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, token=0] [L289] COND FALSE !(M_E == 1) [L294] COND FALSE !(T1_E == 1) [L299] COND FALSE !(E_M == 1) [L304] COND FALSE !(E_1 == 1) [L427] RET reset_delta_events() VAL [E_1=2, E_M=2, local=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, token=0] [L430] COND TRUE 1 [L433] kernel_st = 1 [L208] int tmp ; VAL [E_1=2, E_M=2, local=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, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=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, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=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, token=0] [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] return (__retres1); [L215] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=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, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=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, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=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, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] return (__retres1); [L215] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=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, token=0] [L45] COND TRUE 1 [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [E_1=1, E_M=2, local=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, token=0] [L51] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=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, token=0] [L343] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=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, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=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, token=0] [L136] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=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, token=0] [L138] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [L142] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=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, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=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, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=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, token=0] [L157] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 [L343] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L51] RET immediate_notify() VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 [L109] token += 1 [L110] E_M = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L343] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 [L142] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) [L343] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] RET immediate_notify() VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] return (__retres1); [L215] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L59] COND FALSE !(token != local + 1) [L64] COND TRUE tmp_var <= 5 [L65] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L73] CALL error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 900.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * CodeCheck took 15303.16 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.0 GB in the beginning and 927.5 MB in the end (delta: 115.0 MB). Peak memory consumption was 308.5 MB. Max. memory is 11.5 GB. * Witness Printer took 150.90 ms. Allocated memory is still 1.3 GB. Free memory was 927.5 MB in the beginning and 914.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...