./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan --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 Taipan --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.23-1dbac8b [2018-10-26 22:00:30,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:00:30,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:00:30,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:00:30,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:00:30,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:00:30,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:00:30,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:00:30,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:00:30,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:00:30,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:00:30,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:00:30,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:00:30,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:00:30,083 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:00:30,084 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:00:30,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:00:30,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:00:30,088 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:00:30,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:00:30,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:00:30,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:00:30,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:00:30,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:00:30,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:00:30,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:00:30,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:00:30,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:00:30,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:00:30,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:00:30,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:00:30,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:00:30,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:00:30,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:00:30,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:00:30,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:00:30,111 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:00:30,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:00:30,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:00:30,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:00:30,131 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:00:30,131 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:00:30,131 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:00:30,132 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:00:30,132 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:00:30,133 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:00:30,133 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:00:30,133 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:00:30,134 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:00:30,134 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:00:30,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:00:30,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:00:30,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:00:30,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:00:30,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:00:30,135 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:00:30,135 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:00:30,135 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:00:30,135 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:00:30,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:00:30,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:00:30,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:00:30,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:00:30,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:00:30,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:00:30,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:00:30,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:00:30,136 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:00:30,136 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:00:30,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:00:30,137 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:00:30,137 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan 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 -> Taipan 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 [2018-10-26 22:00:30,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:00:30,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:00:30,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:00:30,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:00:30,192 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:00:30,193 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-10-26 22:00:30,240 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/data/92b1bdf98/6875f68597564ed5865b2b36c817165f/FLAGc7a0ce695 [2018-10-26 22:00:30,591 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:00:30,593 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-10-26 22:00:30,600 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/data/92b1bdf98/6875f68597564ed5865b2b36c817165f/FLAGc7a0ce695 [2018-10-26 22:00:30,609 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/data/92b1bdf98/6875f68597564ed5865b2b36c817165f [2018-10-26 22:00:30,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:00:30,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:00:30,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:00:30,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:00:30,617 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:00:30,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bfd9b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30, skipping insertion in model container [2018-10-26 22:00:30,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:00:30,657 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:00:30,803 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:00:30,807 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:00:30,836 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:00:30,850 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:00:30,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30 WrapperNode [2018-10-26 22:00:30,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:00:30,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:00:30,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:00:30,851 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:00:30,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:00:30,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:00:30,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:00:30,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:00:30,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... [2018-10-26 22:00:30,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:00:30,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:00:30,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:00:30,899 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:00:30,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/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 [2018-10-26 22:00:31,018 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-10-26 22:00:31,018 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-10-26 22:00:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-10-26 22:00:31,019 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-10-26 22:00:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-10-26 22:00:31,019 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-10-26 22:00:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-10-26 22:00:31,019 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-10-26 22:00:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-10-26 22:00:31,019 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-10-26 22:00:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-10-26 22:00:31,020 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-10-26 22:00:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-10-26 22:00:31,020 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-10-26 22:00:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:00:31,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:00:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-10-26 22:00:31,021 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-10-26 22:00:31,021 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-10-26 22:00:31,021 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-10-26 22:00:31,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:00:31,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:00:31,021 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-10-26 22:00:31,021 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-10-26 22:00:31,021 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-10-26 22:00:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-10-26 22:00:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-10-26 22:00:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-10-26 22:00:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-10-26 22:00:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-10-26 22:00:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-10-26 22:00:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-10-26 22:00:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-10-26 22:00:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-10-26 22:00:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:00:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:00:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-10-26 22:00:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-10-26 22:00:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-10-26 22:00:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-10-26 22:00:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-10-26 22:00:31,024 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-10-26 22:00:31,876 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:00:31,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:00:31 BoogieIcfgContainer [2018-10-26 22:00:31,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:00:31,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:00:31,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:00:31,881 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:00:31,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:00:30" (1/3) ... [2018-10-26 22:00:31,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a82d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:00:31, skipping insertion in model container [2018-10-26 22:00:31,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:00:30" (2/3) ... [2018-10-26 22:00:31,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a82d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:00:31, skipping insertion in model container [2018-10-26 22:00:31,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:00:31" (3/3) ... [2018-10-26 22:00:31,884 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_false-unreach-call_false-termination.cil.c [2018-10-26 22:00:31,892 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:00:31,899 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:00:31,914 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:00:31,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:00:31,942 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:00:31,942 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:00:31,942 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:00:31,942 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:00:31,943 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:00:31,943 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:00:31,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:00:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-10-26 22:00:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:00:31,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:31,971 INFO L375 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, 1, 1, 1, 1, 1] [2018-10-26 22:00:31,973 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:31,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:31,978 INFO L82 PathProgramCache]: Analyzing trace with hash 14205677, now seen corresponding path program 1 times [2018-10-26 22:00:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:32,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:32,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:32,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:00:32,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:00:32,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:00:32,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:32,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:00:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:00:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:00:32,439 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2018-10-26 22:00:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:33,391 INFO L93 Difference]: Finished difference Result 321 states and 459 transitions. [2018-10-26 22:00:33,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:00:33,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-10-26 22:00:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:33,410 INFO L225 Difference]: With dead ends: 321 [2018-10-26 22:00:33,410 INFO L226 Difference]: Without dead ends: 173 [2018-10-26 22:00:33,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:00:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-26 22:00:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2018-10-26 22:00:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-26 22:00:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2018-10-26 22:00:33,479 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 80 [2018-10-26 22:00:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:33,479 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2018-10-26 22:00:33,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:00:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2018-10-26 22:00:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:00:33,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:33,482 INFO L375 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, 1, 1, 1, 1, 1] [2018-10-26 22:00:33,482 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:33,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:33,483 INFO L82 PathProgramCache]: Analyzing trace with hash 574905455, now seen corresponding path program 1 times [2018-10-26 22:00:33,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:33,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:33,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:33,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:33,484 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:00:33,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:00:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:00:33,573 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:33,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:00:33,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:00:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:00:33,575 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand 5 states. [2018-10-26 22:00:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:34,050 INFO L93 Difference]: Finished difference Result 300 states and 409 transitions. [2018-10-26 22:00:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:00:34,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-10-26 22:00:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:34,054 INFO L225 Difference]: With dead ends: 300 [2018-10-26 22:00:34,054 INFO L226 Difference]: Without dead ends: 173 [2018-10-26 22:00:34,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:00:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-26 22:00:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2018-10-26 22:00:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-26 22:00:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2018-10-26 22:00:34,074 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 80 [2018-10-26 22:00:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:34,075 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2018-10-26 22:00:34,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:00:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2018-10-26 22:00:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:00:34,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:34,077 INFO L375 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, 1, 1, 1, 1, 1] [2018-10-26 22:00:34,077 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:34,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1008634541, now seen corresponding path program 1 times [2018-10-26 22:00:34,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:34,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:34,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:34,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:34,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:00:34,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:00:34,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:00:34,167 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:34,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:00:34,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:00:34,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:00:34,169 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand 5 states. [2018-10-26 22:00:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:34,678 INFO L93 Difference]: Finished difference Result 316 states and 431 transitions. [2018-10-26 22:00:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:00:34,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-10-26 22:00:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:34,680 INFO L225 Difference]: With dead ends: 316 [2018-10-26 22:00:34,680 INFO L226 Difference]: Without dead ends: 189 [2018-10-26 22:00:34,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:00:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-26 22:00:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 146. [2018-10-26 22:00:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-26 22:00:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2018-10-26 22:00:34,697 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 80 [2018-10-26 22:00:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:34,697 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2018-10-26 22:00:34,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:00:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-10-26 22:00:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:00:34,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:34,699 INFO L375 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, 1, 1, 1, 1, 1] [2018-10-26 22:00:34,699 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:34,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:34,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2025415505, now seen corresponding path program 1 times [2018-10-26 22:00:34,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:34,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:34,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:34,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:34,701 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:00:34,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:00:34,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:00:34,787 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:34,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:00:34,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:00:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:00:34,788 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 5 states. [2018-10-26 22:00:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:35,333 INFO L93 Difference]: Finished difference Result 309 states and 419 transitions. [2018-10-26 22:00:35,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:00:35,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-10-26 22:00:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:35,335 INFO L225 Difference]: With dead ends: 309 [2018-10-26 22:00:35,335 INFO L226 Difference]: Without dead ends: 182 [2018-10-26 22:00:35,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:00:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-26 22:00:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 146. [2018-10-26 22:00:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-26 22:00:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2018-10-26 22:00:35,353 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 80 [2018-10-26 22:00:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:35,354 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2018-10-26 22:00:35,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:00:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2018-10-26 22:00:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:00:35,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:35,355 INFO L375 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, 1, 1, 1, 1, 1] [2018-10-26 22:00:35,355 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:35,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:35,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1984740755, now seen corresponding path program 1 times [2018-10-26 22:00:35,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:35,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:35,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:35,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:35,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:00:35,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:00:35,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:00:35,458 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:35,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:00:35,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:00:35,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:00:35,459 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand 4 states. [2018-10-26 22:00:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:35,682 INFO L93 Difference]: Finished difference Result 384 states and 517 transitions. [2018-10-26 22:00:35,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:00:35,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-10-26 22:00:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:35,687 INFO L225 Difference]: With dead ends: 384 [2018-10-26 22:00:35,687 INFO L226 Difference]: Without dead ends: 258 [2018-10-26 22:00:35,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:00:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-26 22:00:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-10-26 22:00:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-26 22:00:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 328 transitions. [2018-10-26 22:00:35,719 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 328 transitions. Word has length 80 [2018-10-26 22:00:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:35,720 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 328 transitions. [2018-10-26 22:00:35,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:00:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 328 transitions. [2018-10-26 22:00:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 22:00:35,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:35,722 INFO L375 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, 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] [2018-10-26 22:00:35,722 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:35,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1044861795, now seen corresponding path program 1 times [2018-10-26 22:00:35,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:35,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:35,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 22:00:35,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:00:35,795 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:00:35,796 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-10-26 22:00:35,797 INFO L202 CegarAbsIntRunner]: [1], [32], [34], [37], [42], [45], [49], [50], [53], [62], [63], [64], [67], [70], [78], [79], [82], [88], [96], [100], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [193], [194], [197], [201], [207], [210], [213], [219], [222], [241], [258], [263], [269], [275], [281], [283], [284], [293], [299], [301], [334], [344], [346], [348], [349], [375], [376], [377], [378], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [395], [396], [397], [398], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-10-26 22:00:35,848 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:00:35,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:00:36,272 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:00:36,280 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 28 variables. [2018-10-26 22:00:36,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:36,326 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:00:36,818 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 71.29% of their original sizes. [2018-10-26 22:00:36,818 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:00:37,596 INFO L415 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2018-10-26 22:00:37,596 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:00:37,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:00:37,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-10-26 22:00:37,597 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:37,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:00:37,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:00:37,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:00:37,602 INFO L87 Difference]: Start difference. First operand 257 states and 328 transitions. Second operand 9 states. [2018-10-26 22:00:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:41,157 INFO L93 Difference]: Finished difference Result 588 states and 762 transitions. [2018-10-26 22:00:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:00:41,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-10-26 22:00:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:41,159 INFO L225 Difference]: With dead ends: 588 [2018-10-26 22:00:41,160 INFO L226 Difference]: Without dead ends: 346 [2018-10-26 22:00:41,161 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:00:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-26 22:00:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 338. [2018-10-26 22:00:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-26 22:00:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 423 transitions. [2018-10-26 22:00:41,225 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 423 transitions. Word has length 127 [2018-10-26 22:00:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:41,226 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 423 transitions. [2018-10-26 22:00:41,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:00:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 423 transitions. [2018-10-26 22:00:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 22:00:41,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:41,229 INFO L375 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, 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] [2018-10-26 22:00:41,229 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:41,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:41,230 INFO L82 PathProgramCache]: Analyzing trace with hash 273636384, now seen corresponding path program 1 times [2018-10-26 22:00:41,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:41,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:41,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:41,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:41,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 22:00:41,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:00:41,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:00:41,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-10-26 22:00:41,357 INFO L202 CegarAbsIntRunner]: [1], [32], [34], [37], [39], [42], [45], [49], [50], [53], [62], [63], [64], [67], [70], [74], [76], [78], [79], [84], [90], [96], [102], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [193], [194], [197], [201], [207], [210], [213], [219], [222], [241], [258], [263], [269], [275], [281], [283], [284], [293], [299], [301], [334], [344], [346], [348], [349], [375], [376], [377], [378], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [395], [396], [397], [398], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-10-26 22:00:41,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:00:41,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:00:41,539 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:00:41,539 INFO L272 AbstractInterpreter]: Visited 49 different actions 49 times. Never merged. Never widened. Never found a fixpoint. Largest state had 28 variables. [2018-10-26 22:00:41,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:41,542 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:00:41,852 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 69.15% of their original sizes. [2018-10-26 22:00:41,853 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:00:42,387 INFO L415 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2018-10-26 22:00:42,387 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:00:42,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:00:42,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-10-26 22:00:42,388 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:42,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 22:00:42,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 22:00:42,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:00:42,389 INFO L87 Difference]: Start difference. First operand 338 states and 423 transitions. Second operand 14 states. [2018-10-26 22:00:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:47,877 INFO L93 Difference]: Finished difference Result 663 states and 839 transitions. [2018-10-26 22:00:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:00:47,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-10-26 22:00:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:47,879 INFO L225 Difference]: With dead ends: 663 [2018-10-26 22:00:47,879 INFO L226 Difference]: Without dead ends: 345 [2018-10-26 22:00:47,880 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:00:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-26 22:00:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2018-10-26 22:00:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-26 22:00:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 418 transitions. [2018-10-26 22:00:47,960 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 418 transitions. Word has length 127 [2018-10-26 22:00:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:47,960 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 418 transitions. [2018-10-26 22:00:47,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 22:00:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 418 transitions. [2018-10-26 22:00:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-26 22:00:47,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:47,964 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:00:47,964 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:47,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1971835940, now seen corresponding path program 1 times [2018-10-26 22:00:47,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:47,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:47,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:47,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:47,966 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 22:00:48,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:00:48,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:00:48,117 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:48,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:00:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:00:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:00:48,118 INFO L87 Difference]: Start difference. First operand 337 states and 418 transitions. Second operand 6 states. [2018-10-26 22:00:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:48,234 INFO L93 Difference]: Finished difference Result 583 states and 754 transitions. [2018-10-26 22:00:48,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:00:48,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-26 22:00:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:48,241 INFO L225 Difference]: With dead ends: 583 [2018-10-26 22:00:48,242 INFO L226 Difference]: Without dead ends: 347 [2018-10-26 22:00:48,243 INFO L605 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 [2018-10-26 22:00:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-26 22:00:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2018-10-26 22:00:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-26 22:00:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 422 transitions. [2018-10-26 22:00:48,324 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 422 transitions. Word has length 148 [2018-10-26 22:00:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:48,328 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 422 transitions. [2018-10-26 22:00:48,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:00:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 422 transitions. [2018-10-26 22:00:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-26 22:00:48,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:48,330 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:00:48,330 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:48,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1312304418, now seen corresponding path program 1 times [2018-10-26 22:00:48,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:48,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:48,331 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:00:48,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:00:48,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:00:48,447 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:48,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:00:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:00:48,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:00:48,449 INFO L87 Difference]: Start difference. First operand 342 states and 422 transitions. Second operand 3 states. [2018-10-26 22:00:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:00:48,644 INFO L93 Difference]: Finished difference Result 888 states and 1145 transitions. [2018-10-26 22:00:48,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:00:48,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-26 22:00:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:00:48,649 INFO L225 Difference]: With dead ends: 888 [2018-10-26 22:00:48,649 INFO L226 Difference]: Without dead ends: 567 [2018-10-26 22:00:48,651 INFO L605 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 [2018-10-26 22:00:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-26 22:00:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 555. [2018-10-26 22:00:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-26 22:00:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 715 transitions. [2018-10-26 22:00:48,732 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 715 transitions. Word has length 148 [2018-10-26 22:00:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:00:48,733 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 715 transitions. [2018-10-26 22:00:48,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:00:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 715 transitions. [2018-10-26 22:00:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 22:00:48,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:00:48,735 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:00:48,735 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:00:48,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash 275818061, now seen corresponding path program 1 times [2018-10-26 22:00:48,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:00:48,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:48,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:00:48,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:00:48,736 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:00:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:00:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 22:00:48,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:00:48,841 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:00:48,841 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-10-26 22:00:48,841 INFO L202 CegarAbsIntRunner]: [1], [4], [15], [21], [23], [31], [32], [34], [39], [42], [45], [47], [49], [50], [53], [55], [58], [62], [63], [64], [67], [70], [74], [76], [78], [79], [84], [90], [96], [102], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [193], [194], [197], [201], [207], [210], [213], [219], [222], [225], [232], [235], [238], [258], [263], [269], [275], [281], [283], [284], [293], [299], [301], [334], [344], [346], [348], [349], [375], [376], [377], [378], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [395], [396], [397], [398], [399], [400], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-10-26 22:00:48,844 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:00:48,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:00:53,893 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:00:53,893 INFO L272 AbstractInterpreter]: Visited 104 different actions 545 times. Merged at 29 different actions 164 times. Never widened. Found 26 fixpoints after 7 different actions. Largest state had 30 variables. [2018-10-26 22:00:53,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:00:53,895 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:00:55,202 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 78.19% of their original sizes. [2018-10-26 22:00:55,202 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:00:59,588 INFO L415 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2018-10-26 22:00:59,588 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:00:59,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:00:59,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [5] total 61 [2018-10-26 22:00:59,589 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:00:59,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-26 22:00:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-26 22:00:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2983, Unknown=0, NotChecked=0, Total=3306 [2018-10-26 22:00:59,591 INFO L87 Difference]: Start difference. First operand 555 states and 715 transitions. Second operand 58 states. [2018-10-26 22:02:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:02:49,702 INFO L93 Difference]: Finished difference Result 2375 states and 3382 transitions. [2018-10-26 22:02:49,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-10-26 22:02:49,702 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 150 [2018-10-26 22:02:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:02:49,707 INFO L225 Difference]: With dead ends: 2375 [2018-10-26 22:02:49,707 INFO L226 Difference]: Without dead ends: 1551 [2018-10-26 22:02:49,722 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 368 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30547 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=4579, Invalid=71873, Unknown=0, NotChecked=0, Total=76452 [2018-10-26 22:02:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2018-10-26 22:02:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1363. [2018-10-26 22:02:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2018-10-26 22:02:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1769 transitions. [2018-10-26 22:02:49,930 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1769 transitions. Word has length 150 [2018-10-26 22:02:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:02:49,930 INFO L481 AbstractCegarLoop]: Abstraction has 1363 states and 1769 transitions. [2018-10-26 22:02:49,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-26 22:02:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1769 transitions. [2018-10-26 22:02:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 22:02:49,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:02:49,933 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:02:49,933 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:02:49,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:02:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1598479424, now seen corresponding path program 1 times [2018-10-26 22:02:49,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:02:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:02:49,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:02:49,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:02:49,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:02:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:02:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 22:02:50,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:02:50,093 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:02:50,093 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-10-26 22:02:50,094 INFO L202 CegarAbsIntRunner]: [1], [6], [9], [15], [21], [23], [25], [27], [31], [32], [34], [37], [39], [42], [45], [47], [49], [50], [53], [62], [63], [64], [67], [70], [74], [76], [78], [79], [84], [90], [96], [102], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [193], [194], [197], [201], [207], [210], [213], [219], [222], [232], [235], [258], [263], [269], [275], [281], [283], [284], [293], [299], [301], [334], [337], [340], [344], [346], [348], [349], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [395], [396], [397], [398], [399], [400], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-10-26 22:02:50,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:02:50,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:02:50,499 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:02:50,499 INFO L272 AbstractInterpreter]: Visited 96 different actions 120 times. Never merged. Never widened. Never found a fixpoint. Largest state had 30 variables. [2018-10-26 22:02:50,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:02:50,510 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:02:51,180 INFO L227 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 78.07% of their original sizes. [2018-10-26 22:02:51,181 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:02:53,040 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-10-26 22:02:53,040 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:02:53,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:02:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [4] total 47 [2018-10-26 22:02:53,041 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:02:53,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-26 22:02:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-26 22:02:53,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1783, Unknown=0, NotChecked=0, Total=1980 [2018-10-26 22:02:53,042 INFO L87 Difference]: Start difference. First operand 1363 states and 1769 transitions. Second operand 45 states. [2018-10-26 22:03:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:03:07,106 INFO L93 Difference]: Finished difference Result 2609 states and 3415 transitions. [2018-10-26 22:03:07,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-26 22:03:07,106 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 163 [2018-10-26 22:03:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:03:07,112 INFO L225 Difference]: With dead ends: 2609 [2018-10-26 22:03:07,113 INFO L226 Difference]: Without dead ends: 1395 [2018-10-26 22:03:07,116 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=685, Invalid=5321, Unknown=0, NotChecked=0, Total=6006 [2018-10-26 22:03:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-10-26 22:03:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1385. [2018-10-26 22:03:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-10-26 22:03:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1788 transitions. [2018-10-26 22:03:07,368 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1788 transitions. Word has length 163 [2018-10-26 22:03:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:03:07,368 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 1788 transitions. [2018-10-26 22:03:07,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-26 22:03:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1788 transitions. [2018-10-26 22:03:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 22:03:07,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:03:07,372 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:03:07,372 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:03:07,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:03:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1867983610, now seen corresponding path program 1 times [2018-10-26 22:03:07,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:03:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:07,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:03:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:07,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:03:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:03:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 22:03:07,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:03:07,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:03:07,447 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:03:07,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:03:07,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:03:07,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:03:07,447 INFO L87 Difference]: Start difference. First operand 1385 states and 1788 transitions. Second operand 4 states. [2018-10-26 22:03:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:03:07,703 INFO L93 Difference]: Finished difference Result 2521 states and 3404 transitions. [2018-10-26 22:03:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:03:07,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 22:03:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:03:07,710 INFO L225 Difference]: With dead ends: 2521 [2018-10-26 22:03:07,710 INFO L226 Difference]: Without dead ends: 1317 [2018-10-26 22:03:07,714 INFO L605 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 [2018-10-26 22:03:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-10-26 22:03:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2018-10-26 22:03:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2018-10-26 22:03:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1639 transitions. [2018-10-26 22:03:07,993 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1639 transitions. Word has length 184 [2018-10-26 22:03:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:03:07,994 INFO L481 AbstractCegarLoop]: Abstraction has 1317 states and 1639 transitions. [2018-10-26 22:03:07,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:03:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1639 transitions. [2018-10-26 22:03:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 22:03:07,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:03:07,996 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:03:07,996 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:03:07,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:03:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash 103167001, now seen corresponding path program 2 times [2018-10-26 22:03:07,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:03:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:03:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:08,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:03:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:03:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-26 22:03:08,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:03:08,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:03:08,411 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:03:08,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:03:08,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:03:08,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:03:08,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:03:08,429 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:03:08,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-26 22:03:08,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:03:08,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:03:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-26 22:03:08,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:03:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-26 22:03:09,481 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:03:09,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-10-26 22:03:09,481 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:03:09,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:03:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:03:09,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:03:09,482 INFO L87 Difference]: Start difference. First operand 1317 states and 1639 transitions. Second operand 6 states. [2018-10-26 22:03:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:03:09,911 INFO L93 Difference]: Finished difference Result 2353 states and 3019 transitions. [2018-10-26 22:03:09,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:03:09,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2018-10-26 22:03:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:03:09,919 INFO L225 Difference]: With dead ends: 2353 [2018-10-26 22:03:09,919 INFO L226 Difference]: Without dead ends: 1213 [2018-10-26 22:03:09,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-26 22:03:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2018-10-26 22:03:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 934. [2018-10-26 22:03:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2018-10-26 22:03:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1109 transitions. [2018-10-26 22:03:10,139 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1109 transitions. Word has length 184 [2018-10-26 22:03:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:03:10,139 INFO L481 AbstractCegarLoop]: Abstraction has 934 states and 1109 transitions. [2018-10-26 22:03:10,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:03:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1109 transitions. [2018-10-26 22:03:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 22:03:10,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:03:10,143 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:03:10,143 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:03:10,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:03:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 125799255, now seen corresponding path program 3 times [2018-10-26 22:03:10,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:03:10,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:10,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:03:10,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:10,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:03:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:03:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-26 22:03:10,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:03:10,752 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:03:10,752 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:03:10,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:03:10,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:03:10,753 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:03:10,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:03:10,766 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:03:10,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:03:10,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:03:10,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:03:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-26 22:03:10,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:03:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 22:03:11,217 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:03:11,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 7 [2018-10-26 22:03:11,218 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:03:11,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:03:11,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:03:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:03:11,218 INFO L87 Difference]: Start difference. First operand 934 states and 1109 transitions. Second operand 3 states. [2018-10-26 22:03:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:03:11,379 INFO L93 Difference]: Finished difference Result 1667 states and 2066 transitions. [2018-10-26 22:03:11,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:03:11,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-26 22:03:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:03:11,384 INFO L225 Difference]: With dead ends: 1667 [2018-10-26 22:03:11,384 INFO L226 Difference]: Without dead ends: 909 [2018-10-26 22:03:11,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 365 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:03:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-10-26 22:03:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2018-10-26 22:03:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-10-26 22:03:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1070 transitions. [2018-10-26 22:03:11,591 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1070 transitions. Word has length 184 [2018-10-26 22:03:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:03:11,591 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 1070 transitions. [2018-10-26 22:03:11,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:03:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1070 transitions. [2018-10-26 22:03:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 22:03:11,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:03:11,593 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:03:11,593 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:03:11,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:03:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1352761130, now seen corresponding path program 1 times [2018-10-26 22:03:11,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:03:11,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:11,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:03:11,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:11,597 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:03:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:03:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 22:03:12,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:03:12,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:03:12,204 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:03:12,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:03:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:03:12,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:03:12,205 INFO L87 Difference]: Start difference. First operand 909 states and 1070 transitions. Second operand 6 states. [2018-10-26 22:03:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:03:13,180 INFO L93 Difference]: Finished difference Result 2279 states and 2836 transitions. [2018-10-26 22:03:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:03:13,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2018-10-26 22:03:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:03:13,185 INFO L225 Difference]: With dead ends: 2279 [2018-10-26 22:03:13,186 INFO L226 Difference]: Without dead ends: 1555 [2018-10-26 22:03:13,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:03:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-10-26 22:03:13,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1525. [2018-10-26 22:03:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2018-10-26 22:03:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1898 transitions. [2018-10-26 22:03:13,474 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1898 transitions. Word has length 185 [2018-10-26 22:03:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:03:13,475 INFO L481 AbstractCegarLoop]: Abstraction has 1525 states and 1898 transitions. [2018-10-26 22:03:13,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:03:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1898 transitions. [2018-10-26 22:03:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 22:03:13,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:03:13,479 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:03:13,479 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:03:13,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:03:13,480 INFO L82 PathProgramCache]: Analyzing trace with hash 219479550, now seen corresponding path program 1 times [2018-10-26 22:03:13,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:03:13,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:13,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:03:13,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:13,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:03:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:03:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-26 22:03:13,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:03:13,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:03:13,583 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:03:13,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:03:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:03:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:03:13,584 INFO L87 Difference]: Start difference. First operand 1525 states and 1898 transitions. Second operand 3 states. [2018-10-26 22:03:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:03:14,039 INFO L93 Difference]: Finished difference Result 2782 states and 3576 transitions. [2018-10-26 22:03:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:03:14,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-26 22:03:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:03:14,047 INFO L225 Difference]: With dead ends: 2782 [2018-10-26 22:03:14,047 INFO L226 Difference]: Without dead ends: 1544 [2018-10-26 22:03:14,052 INFO L605 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 [2018-10-26 22:03:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-10-26 22:03:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1541. [2018-10-26 22:03:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2018-10-26 22:03:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1922 transitions. [2018-10-26 22:03:14,317 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1922 transitions. Word has length 189 [2018-10-26 22:03:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:03:14,319 INFO L481 AbstractCegarLoop]: Abstraction has 1541 states and 1922 transitions. [2018-10-26 22:03:14,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:03:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1922 transitions. [2018-10-26 22:03:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 22:03:14,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:03:14,321 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:03:14,321 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:03:14,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:03:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash -556883815, now seen corresponding path program 1 times [2018-10-26 22:03:14,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:03:14,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:14,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:03:14,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:03:14,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:03:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:03:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:03:14,403 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:03:14,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:03:14 BoogieIcfgContainer [2018-10-26 22:03:14,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:03:14,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:03:14,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:03:14,498 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:03:14,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:00:31" (3/4) ... [2018-10-26 22:03:14,500 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:03:14,621 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4a8f8a2e-b5d4-409c-9d6b-fd44c6204f5c/bin-2019/utaipan/witness.graphml [2018-10-26 22:03:14,621 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:03:14,622 INFO L168 Benchmark]: Toolchain (without parser) took 164010.18 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 957.0 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 455.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:03:14,623 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:03:14,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.03 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 943.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:03:14,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.92 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:03:14,624 INFO L168 Benchmark]: Boogie Preprocessor took 27.42 ms. Allocated memory is still 1.0 GB. Free memory was 940.9 MB in the beginning and 938.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:03:14,624 INFO L168 Benchmark]: RCFGBuilder took 978.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:03:14,625 INFO L168 Benchmark]: TraceAbstraction took 162620.15 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 403.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:03:14,625 INFO L168 Benchmark]: Witness Printer took 123.57 ms. Allocated memory is still 3.8 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:03:14,630 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.03 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 943.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.92 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.42 ms. Allocated memory is still 1.0 GB. Free memory was 940.9 MB in the beginning and 938.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 978.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 162620.15 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 403.5 MB. Max. memory is 11.5 GB. * Witness Printer took 123.57 ms. Allocated memory is still 3.8 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 ; VAL [\old(E_1)=7, \old(E_M)=12, \old(local)=3, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=11, \old(m_st)=10, \old(T1_E)=4, \old(t1_i)=13, \old(t1_pc)=8, \old(t1_st)=5, \old(token)=9, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L479] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L390] m_i = 1 [L391] RET t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L479] init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L480] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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 [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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] [L424] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L177] COND TRUE t1_i == 1 [L178] RET t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L424] init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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(local)=0, \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, \old(token)=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] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L276] COND FALSE, RET !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L425] fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=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] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=0, __retres1=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] [L319] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, 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] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=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] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=0, __retres1=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] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, 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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE, RET !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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, tmp=0, tmp___0=0, token=0] [L426] activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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(local)=0, \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, \old(token)=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] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L304] COND FALSE, RET !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L427] reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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] [L433] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, kernel_st=1, 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] [L434] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L208] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=1, 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] [L203] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=1, __retres1=1, 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] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, 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 [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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, tmp=1, 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 [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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, tmp=1, tmp_ndt_1=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 [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, token=0] [L103] t1_pc = 1 [L104] RET t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, t1_st=2, token=0] [L242] transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=1, 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] [L203] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=1, __retres1=1, 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] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=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=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, 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 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=0, 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] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=0, __retres1=0, 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] [L319] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, 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] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=1, 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] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=1, __retres1=1, 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] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, 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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] RET t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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] immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp_var=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] RET m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp_var=0, token=0] [L228] master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, 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 [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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 [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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] [L109] token += 1 [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=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] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=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] [L319] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=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] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, 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] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, 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] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, 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, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE, RET !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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] immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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 [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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] [L103] t1_pc = 1 [L104] RET t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, 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] [L242] transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=1, 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] [L203] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=1, __retres1=1, 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] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=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=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, 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 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, 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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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 [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 155 locations, 1 error locations. UNSAFE Result, 162.5s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 138.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3859 SDtfs, 6352 SDslu, 18775 SDs, 0 SdLazy, 13016 SolverSat, 2636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1649 GetRequests, 1194 SyntacticMatches, 23 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32240 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1541occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.1s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9855977375693173 AbsIntWeakeningRatio, 0.5541740674955595 AbsIntAvgWeakeningVarsNumRemoved, 615.2007104795737 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 677 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2747 NumberOfCodeBlocks, 2622 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2905 ConstructedInterpolants, 0 QuantifiedInterpolants, 604722 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 1267/1321 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...