./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.05.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5937481bc19468f59d919de13c534d2ea0f2da0e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-7b2dab5 [2020-12-09 05:20:06,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:20:06,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:20:06,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:20:06,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:20:06,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:20:06,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:20:06,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:20:06,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:20:06,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:20:06,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:20:06,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:20:06,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:20:06,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:20:06,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:20:06,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:20:06,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:20:06,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:20:06,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:20:06,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:20:06,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:20:06,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:20:06,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:20:06,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:20:06,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:20:06,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:20:06,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:20:06,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:20:06,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:20:06,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:20:06,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:20:06,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:20:06,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:20:06,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:20:06,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:20:06,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:20:06,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:20:06,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:20:06,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:20:06,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:20:06,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:20:06,356 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 05:20:06,372 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:20:06,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:20:06,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:20:06,373 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:20:06,373 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:20:06,373 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:20:06,373 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:20:06,374 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:20:06,374 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:20:06,374 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:20:06,374 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:20:06,374 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:20:06,374 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:20:06,374 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:20:06,374 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:20:06,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:20:06,375 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:20:06,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:20:06,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:20:06,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:20:06,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 05:20:06,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:20:06,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 05:20:06,376 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:20:06,376 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:20:06,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 05:20:06,376 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:20:06,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 05:20:06,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:20:06,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:20:06,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:20:06,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:20:06,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:20:06,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 05:20:06,377 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:20:06,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:20:06,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 05:20:06,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:20:06,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:20:06,378 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/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(reach_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 -> 5937481bc19468f59d919de13c534d2ea0f2da0e [2020-12-09 05:20:06,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:20:06,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:20:06,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:20:06,560 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:20:06,560 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:20:06,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.05.cil-2.c [2020-12-09 05:20:06,609 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/data/ace9f4fcd/32ef63105a8840b4a82087c55fa320bf/FLAG665011cb6 [2020-12-09 05:20:06,998 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:20:06,998 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/sv-benchmarks/c/systemc/token_ring.05.cil-2.c [2020-12-09 05:20:07,007 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/data/ace9f4fcd/32ef63105a8840b4a82087c55fa320bf/FLAG665011cb6 [2020-12-09 05:20:07,402 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/data/ace9f4fcd/32ef63105a8840b4a82087c55fa320bf [2020-12-09 05:20:07,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:20:07,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:20:07,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:20:07,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:20:07,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:20:07,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa6a113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07, skipping insertion in model container [2020-12-09 05:20:07,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:20:07,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:20:07,548 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/sv-benchmarks/c/systemc/token_ring.05.cil-2.c[366,379] [2020-12-09 05:20:07,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:20:07,614 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:20:07,622 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/sv-benchmarks/c/systemc/token_ring.05.cil-2.c[366,379] [2020-12-09 05:20:07,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:20:07,667 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:20:07,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07 WrapperNode [2020-12-09 05:20:07,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:20:07,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:20:07,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:20:07,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:20:07,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:20:07,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:20:07,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:20:07,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:20:07,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... [2020-12-09 05:20:07,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:20:07,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:20:07,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:20:07,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:20:07,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/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 [2020-12-09 05:20:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:20:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:20:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:20:07,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:20:09,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:20:09,906 INFO L299 CfgBuilder]: Removed 198 assume(true) statements. [2020-12-09 05:20:09,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:20:09 BoogieIcfgContainer [2020-12-09 05:20:09,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:20:09,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:20:09,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:20:09,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:20:09,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:20:07" (1/3) ... [2020-12-09 05:20:09,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df77e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:20:09, skipping insertion in model container [2020-12-09 05:20:09,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:20:07" (2/3) ... [2020-12-09 05:20:09,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df77e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:20:09, skipping insertion in model container [2020-12-09 05:20:09,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:20:09" (3/3) ... [2020-12-09 05:20:09,914 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-2.c [2020-12-09 05:20:09,924 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:20:09,927 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 05:20:09,934 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-09 05:20:09,952 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:20:09,952 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 05:20:09,952 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:20:09,952 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:20:09,952 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:20:09,952 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:20:09,953 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:20:09,953 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:20:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states. [2020-12-09 05:20:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 05:20:09,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:09,972 INFO L422 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] [2020-12-09 05:20:09,972 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1743258278, now seen corresponding path program 1 times [2020-12-09 05:20:09,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:09,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088979328] [2020-12-09 05:20:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:10,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088979328] [2020-12-09 05:20:10,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:10,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:20:10,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053890208] [2020-12-09 05:20:10,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:10,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:10,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:10,159 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 3 states. [2020-12-09 05:20:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:10,251 INFO L93 Difference]: Finished difference Result 747 states and 1143 transitions. [2020-12-09 05:20:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:10,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-09 05:20:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:10,264 INFO L225 Difference]: With dead ends: 747 [2020-12-09 05:20:10,264 INFO L226 Difference]: Without dead ends: 481 [2020-12-09 05:20:10,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-09 05:20:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 459. [2020-12-09 05:20:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-12-09 05:20:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 687 transitions. [2020-12-09 05:20:10,322 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 687 transitions. Word has length 28 [2020-12-09 05:20:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:10,322 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 687 transitions. [2020-12-09 05:20:10,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:20:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 687 transitions. [2020-12-09 05:20:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 05:20:10,326 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:10,326 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:20:10,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:20:10,326 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1215516164, now seen corresponding path program 1 times [2020-12-09 05:20:10,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:10,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849370800] [2020-12-09 05:20:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:20:10,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849370800] [2020-12-09 05:20:10,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:10,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:10,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148907262] [2020-12-09 05:20:10,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:20:10,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:10,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:20:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:10,388 INFO L87 Difference]: Start difference. First operand 459 states and 687 transitions. Second operand 4 states. [2020-12-09 05:20:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:10,535 INFO L93 Difference]: Finished difference Result 1501 states and 2235 transitions. [2020-12-09 05:20:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:20:10,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-12-09 05:20:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:10,541 INFO L225 Difference]: With dead ends: 1501 [2020-12-09 05:20:10,541 INFO L226 Difference]: Without dead ends: 1051 [2020-12-09 05:20:10,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2020-12-09 05:20:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 827. [2020-12-09 05:20:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2020-12-09 05:20:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1223 transitions. [2020-12-09 05:20:10,578 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1223 transitions. Word has length 57 [2020-12-09 05:20:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:10,578 INFO L481 AbstractCegarLoop]: Abstraction has 827 states and 1223 transitions. [2020-12-09 05:20:10,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:20:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1223 transitions. [2020-12-09 05:20:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 05:20:10,581 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:10,582 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:20:10,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:20:10,582 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:10,582 INFO L82 PathProgramCache]: Analyzing trace with hash -708489956, now seen corresponding path program 1 times [2020-12-09 05:20:10,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:10,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181787558] [2020-12-09 05:20:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:20:10,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181787558] [2020-12-09 05:20:10,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:10,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:20:10,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563200126] [2020-12-09 05:20:10,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:10,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:10,636 INFO L87 Difference]: Start difference. First operand 827 states and 1223 transitions. Second operand 3 states. [2020-12-09 05:20:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:10,707 INFO L93 Difference]: Finished difference Result 2325 states and 3435 transitions. [2020-12-09 05:20:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:10,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-12-09 05:20:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:10,714 INFO L225 Difference]: With dead ends: 2325 [2020-12-09 05:20:10,714 INFO L226 Difference]: Without dead ends: 1514 [2020-12-09 05:20:10,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2020-12-09 05:20:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1506. [2020-12-09 05:20:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2020-12-09 05:20:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2198 transitions. [2020-12-09 05:20:10,754 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2198 transitions. Word has length 57 [2020-12-09 05:20:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:10,754 INFO L481 AbstractCegarLoop]: Abstraction has 1506 states and 2198 transitions. [2020-12-09 05:20:10,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:20:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2198 transitions. [2020-12-09 05:20:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 05:20:10,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:10,757 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:20:10,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 05:20:10,757 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1983592645, now seen corresponding path program 1 times [2020-12-09 05:20:10,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:10,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443297470] [2020-12-09 05:20:10,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:10,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443297470] [2020-12-09 05:20:10,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:10,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:10,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706032710] [2020-12-09 05:20:10,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:20:10,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:10,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:20:10,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:10,828 INFO L87 Difference]: Start difference. First operand 1506 states and 2198 transitions. Second operand 4 states. [2020-12-09 05:20:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:11,002 INFO L93 Difference]: Finished difference Result 4981 states and 7219 transitions. [2020-12-09 05:20:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:20:11,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-12-09 05:20:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:11,018 INFO L225 Difference]: With dead ends: 4981 [2020-12-09 05:20:11,018 INFO L226 Difference]: Without dead ends: 3487 [2020-12-09 05:20:11,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2020-12-09 05:20:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 2753. [2020-12-09 05:20:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2753 states. [2020-12-09 05:20:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3963 transitions. [2020-12-09 05:20:11,099 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3963 transitions. Word has length 57 [2020-12-09 05:20:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:11,099 INFO L481 AbstractCegarLoop]: Abstraction has 2753 states and 3963 transitions. [2020-12-09 05:20:11,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:20:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3963 transitions. [2020-12-09 05:20:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 05:20:11,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:11,102 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:20:11,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 05:20:11,102 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2096979302, now seen corresponding path program 1 times [2020-12-09 05:20:11,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:11,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192852053] [2020-12-09 05:20:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:11,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192852053] [2020-12-09 05:20:11,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:11,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:11,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944357045] [2020-12-09 05:20:11,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:20:11,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:20:11,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:11,165 INFO L87 Difference]: Start difference. First operand 2753 states and 3963 transitions. Second operand 4 states. [2020-12-09 05:20:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:11,427 INFO L93 Difference]: Finished difference Result 9003 states and 12873 transitions. [2020-12-09 05:20:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:20:11,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-12-09 05:20:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:11,462 INFO L225 Difference]: With dead ends: 9003 [2020-12-09 05:20:11,462 INFO L226 Difference]: Without dead ends: 6268 [2020-12-09 05:20:11,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2020-12-09 05:20:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 5032. [2020-12-09 05:20:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5032 states. [2020-12-09 05:20:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 7144 transitions. [2020-12-09 05:20:11,655 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 7144 transitions. Word has length 57 [2020-12-09 05:20:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:11,656 INFO L481 AbstractCegarLoop]: Abstraction has 5032 states and 7144 transitions. [2020-12-09 05:20:11,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:20:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 7144 transitions. [2020-12-09 05:20:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 05:20:11,659 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:11,659 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:20:11,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 05:20:11,660 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash -920374983, now seen corresponding path program 1 times [2020-12-09 05:20:11,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:11,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011594226] [2020-12-09 05:20:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:11,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011594226] [2020-12-09 05:20:11,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:11,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:11,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991442881] [2020-12-09 05:20:11,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:11,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:11,721 INFO L87 Difference]: Start difference. First operand 5032 states and 7144 transitions. Second operand 3 states. [2020-12-09 05:20:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:11,845 INFO L93 Difference]: Finished difference Result 8508 states and 12314 transitions. [2020-12-09 05:20:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:11,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-12-09 05:20:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:11,868 INFO L225 Difference]: With dead ends: 8508 [2020-12-09 05:20:11,868 INFO L226 Difference]: Without dead ends: 5720 [2020-12-09 05:20:11,872 INFO L677 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 [2020-12-09 05:20:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2020-12-09 05:20:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5448. [2020-12-09 05:20:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5448 states. [2020-12-09 05:20:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5448 states to 5448 states and 7864 transitions. [2020-12-09 05:20:12,037 INFO L78 Accepts]: Start accepts. Automaton has 5448 states and 7864 transitions. Word has length 57 [2020-12-09 05:20:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:12,037 INFO L481 AbstractCegarLoop]: Abstraction has 5448 states and 7864 transitions. [2020-12-09 05:20:12,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:20:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5448 states and 7864 transitions. [2020-12-09 05:20:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-09 05:20:12,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:12,044 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:20:12,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 05:20:12,044 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash -498749985, now seen corresponding path program 1 times [2020-12-09 05:20:12,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:12,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91356994] [2020-12-09 05:20:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:12,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91356994] [2020-12-09 05:20:12,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:12,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:20:12,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117465248] [2020-12-09 05:20:12,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:12,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:12,093 INFO L87 Difference]: Start difference. First operand 5448 states and 7864 transitions. Second operand 3 states. [2020-12-09 05:20:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:12,282 INFO L93 Difference]: Finished difference Result 15438 states and 22266 transitions. [2020-12-09 05:20:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:12,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-12-09 05:20:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:12,316 INFO L225 Difference]: With dead ends: 15438 [2020-12-09 05:20:12,316 INFO L226 Difference]: Without dead ends: 9995 [2020-12-09 05:20:12,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2020-12-09 05:20:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9943. [2020-12-09 05:20:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9943 states. [2020-12-09 05:20:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9943 states to 9943 states and 14165 transitions. [2020-12-09 05:20:12,555 INFO L78 Accepts]: Start accepts. Automaton has 9943 states and 14165 transitions. Word has length 79 [2020-12-09 05:20:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:12,555 INFO L481 AbstractCegarLoop]: Abstraction has 9943 states and 14165 transitions. [2020-12-09 05:20:12,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:20:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 9943 states and 14165 transitions. [2020-12-09 05:20:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-09 05:20:12,567 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:12,567 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:20:12,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 05:20:12,568 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1555351933, now seen corresponding path program 1 times [2020-12-09 05:20:12,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:12,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526616502] [2020-12-09 05:20:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:20:12,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526616502] [2020-12-09 05:20:12,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:12,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:12,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005316680] [2020-12-09 05:20:12,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:20:12,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:20:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:12,623 INFO L87 Difference]: Start difference. First operand 9943 states and 14165 transitions. Second operand 4 states. [2020-12-09 05:20:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:13,164 INFO L93 Difference]: Finished difference Result 35411 states and 50731 transitions. [2020-12-09 05:20:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:20:13,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2020-12-09 05:20:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:13,204 INFO L225 Difference]: With dead ends: 35411 [2020-12-09 05:20:13,204 INFO L226 Difference]: Without dead ends: 25487 [2020-12-09 05:20:13,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25487 states. [2020-12-09 05:20:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25487 to 18839. [2020-12-09 05:20:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18839 states. [2020-12-09 05:20:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18839 states to 18839 states and 26725 transitions. [2020-12-09 05:20:13,625 INFO L78 Accepts]: Start accepts. Automaton has 18839 states and 26725 transitions. Word has length 82 [2020-12-09 05:20:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:13,625 INFO L481 AbstractCegarLoop]: Abstraction has 18839 states and 26725 transitions. [2020-12-09 05:20:13,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:20:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18839 states and 26725 transitions. [2020-12-09 05:20:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-09 05:20:13,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:13,646 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:20:13,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 05:20:13,646 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:13,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1329623519, now seen corresponding path program 1 times [2020-12-09 05:20:13,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:13,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695470448] [2020-12-09 05:20:13,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:20:13,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695470448] [2020-12-09 05:20:13,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:13,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:13,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038671950] [2020-12-09 05:20:13,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:20:13,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:20:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:13,694 INFO L87 Difference]: Start difference. First operand 18839 states and 26725 transitions. Second operand 4 states. [2020-12-09 05:20:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:14,601 INFO L93 Difference]: Finished difference Result 66163 states and 94411 transitions. [2020-12-09 05:20:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:20:14,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-12-09 05:20:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:14,652 INFO L225 Difference]: With dead ends: 66163 [2020-12-09 05:20:14,652 INFO L226 Difference]: Without dead ends: 47343 [2020-12-09 05:20:14,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47343 states. [2020-12-09 05:20:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47343 to 35607. [2020-12-09 05:20:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2020-12-09 05:20:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 50261 transitions. [2020-12-09 05:20:15,458 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 50261 transitions. Word has length 83 [2020-12-09 05:20:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:15,458 INFO L481 AbstractCegarLoop]: Abstraction has 35607 states and 50261 transitions. [2020-12-09 05:20:15,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:20:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 50261 transitions. [2020-12-09 05:20:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-09 05:20:15,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:15,500 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:20:15,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 05:20:15,500 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:15,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2078430974, now seen corresponding path program 1 times [2020-12-09 05:20:15,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:15,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472315160] [2020-12-09 05:20:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:20:15,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472315160] [2020-12-09 05:20:15,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:15,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:15,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340828508] [2020-12-09 05:20:15,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:20:15,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:20:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:15,555 INFO L87 Difference]: Start difference. First operand 35607 states and 50261 transitions. Second operand 4 states. [2020-12-09 05:20:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:16,979 INFO L93 Difference]: Finished difference Result 102051 states and 144539 transitions. [2020-12-09 05:20:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:20:16,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-09 05:20:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:17,047 INFO L225 Difference]: With dead ends: 102051 [2020-12-09 05:20:17,047 INFO L226 Difference]: Without dead ends: 66463 [2020-12-09 05:20:17,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66463 states. [2020-12-09 05:20:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66463 to 51703. [2020-12-09 05:20:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51703 states. [2020-12-09 05:20:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51703 states to 51703 states and 72981 transitions. [2020-12-09 05:20:18,312 INFO L78 Accepts]: Start accepts. Automaton has 51703 states and 72981 transitions. Word has length 84 [2020-12-09 05:20:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:18,313 INFO L481 AbstractCegarLoop]: Abstraction has 51703 states and 72981 transitions. [2020-12-09 05:20:18,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:20:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 51703 states and 72981 transitions. [2020-12-09 05:20:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-09 05:20:18,358 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:18,359 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:20:18,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 05:20:18,359 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:18,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash -322137156, now seen corresponding path program 1 times [2020-12-09 05:20:18,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:18,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070747469] [2020-12-09 05:20:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:18,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070747469] [2020-12-09 05:20:18,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:18,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:20:18,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738801774] [2020-12-09 05:20:18,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:20:18,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:18,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:20:18,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:18,416 INFO L87 Difference]: Start difference. First operand 51703 states and 72981 transitions. Second operand 5 states. [2020-12-09 05:20:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:19,784 INFO L93 Difference]: Finished difference Result 95041 states and 135169 transitions. [2020-12-09 05:20:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:20:19,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-12-09 05:20:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:19,832 INFO L225 Difference]: With dead ends: 95041 [2020-12-09 05:20:19,833 INFO L226 Difference]: Without dead ends: 43357 [2020-12-09 05:20:19,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:20:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43357 states. [2020-12-09 05:20:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43357 to 39472. [2020-12-09 05:20:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39472 states. [2020-12-09 05:20:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39472 states to 39472 states and 56923 transitions. [2020-12-09 05:20:20,846 INFO L78 Accepts]: Start accepts. Automaton has 39472 states and 56923 transitions. Word has length 85 [2020-12-09 05:20:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:20,846 INFO L481 AbstractCegarLoop]: Abstraction has 39472 states and 56923 transitions. [2020-12-09 05:20:20,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:20:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 39472 states and 56923 transitions. [2020-12-09 05:20:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-09 05:20:20,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:20,877 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:20:20,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 05:20:20,877 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1230820590, now seen corresponding path program 1 times [2020-12-09 05:20:20,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:20,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639982745] [2020-12-09 05:20:20,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:20,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639982745] [2020-12-09 05:20:20,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:20,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:20,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757182457] [2020-12-09 05:20:20,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:20,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:20,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:20,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:20,917 INFO L87 Difference]: Start difference. First operand 39472 states and 56923 transitions. Second operand 3 states. [2020-12-09 05:20:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:21,815 INFO L93 Difference]: Finished difference Result 69169 states and 99800 transitions. [2020-12-09 05:20:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:21,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-09 05:20:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:21,850 INFO L225 Difference]: With dead ends: 69169 [2020-12-09 05:20:21,850 INFO L226 Difference]: Without dead ends: 39597 [2020-12-09 05:20:21,868 INFO L677 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 [2020-12-09 05:20:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39597 states. [2020-12-09 05:20:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39597 to 39344. [2020-12-09 05:20:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39344 states. [2020-12-09 05:20:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39344 states to 39344 states and 55515 transitions. [2020-12-09 05:20:22,771 INFO L78 Accepts]: Start accepts. Automaton has 39344 states and 55515 transitions. Word has length 87 [2020-12-09 05:20:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:22,771 INFO L481 AbstractCegarLoop]: Abstraction has 39344 states and 55515 transitions. [2020-12-09 05:20:22,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:20:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 39344 states and 55515 transitions. [2020-12-09 05:20:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-09 05:20:22,797 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:22,798 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:20:22,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 05:20:22,798 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:22,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:22,798 INFO L82 PathProgramCache]: Analyzing trace with hash 441697041, now seen corresponding path program 1 times [2020-12-09 05:20:22,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:22,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977802960] [2020-12-09 05:20:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:22,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977802960] [2020-12-09 05:20:22,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:22,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:20:22,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697993445] [2020-12-09 05:20:22,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:20:22,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:22,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:20:22,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:22,842 INFO L87 Difference]: Start difference. First operand 39344 states and 55515 transitions. Second operand 5 states. [2020-12-09 05:20:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:23,881 INFO L93 Difference]: Finished difference Result 69473 states and 97608 transitions. [2020-12-09 05:20:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:20:23,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-12-09 05:20:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:23,918 INFO L225 Difference]: With dead ends: 69473 [2020-12-09 05:20:23,918 INFO L226 Difference]: Without dead ends: 40093 [2020-12-09 05:20:23,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:20:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40093 states. [2020-12-09 05:20:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40093 to 36272. [2020-12-09 05:20:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36272 states. [2020-12-09 05:20:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36272 states to 36272 states and 51515 transitions. [2020-12-09 05:20:24,995 INFO L78 Accepts]: Start accepts. Automaton has 36272 states and 51515 transitions. Word has length 87 [2020-12-09 05:20:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:24,995 INFO L481 AbstractCegarLoop]: Abstraction has 36272 states and 51515 transitions. [2020-12-09 05:20:24,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:20:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 36272 states and 51515 transitions. [2020-12-09 05:20:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-09 05:20:25,028 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:25,028 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1] [2020-12-09 05:20:25,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 05:20:25,028 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2102371495, now seen corresponding path program 1 times [2020-12-09 05:20:25,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:25,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189615448] [2020-12-09 05:20:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:25,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189615448] [2020-12-09 05:20:25,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:25,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:20:25,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910109884] [2020-12-09 05:20:25,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:20:25,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:25,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:20:25,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:25,086 INFO L87 Difference]: Start difference. First operand 36272 states and 51515 transitions. Second operand 5 states. [2020-12-09 05:20:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:26,349 INFO L93 Difference]: Finished difference Result 64833 states and 91528 transitions. [2020-12-09 05:20:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:20:26,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2020-12-09 05:20:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:26,388 INFO L225 Difference]: With dead ends: 64833 [2020-12-09 05:20:26,388 INFO L226 Difference]: Without dead ends: 38525 [2020-12-09 05:20:26,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:20:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38525 states. [2020-12-09 05:20:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38525 to 34736. [2020-12-09 05:20:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34736 states. [2020-12-09 05:20:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34736 states to 34736 states and 49515 transitions. [2020-12-09 05:20:27,569 INFO L78 Accepts]: Start accepts. Automaton has 34736 states and 49515 transitions. Word has length 89 [2020-12-09 05:20:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:27,569 INFO L481 AbstractCegarLoop]: Abstraction has 34736 states and 49515 transitions. [2020-12-09 05:20:27,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:20:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 34736 states and 49515 transitions. [2020-12-09 05:20:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-09 05:20:27,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:27,602 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2020-12-09 05:20:27,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 05:20:27,602 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash 269123980, now seen corresponding path program 1 times [2020-12-09 05:20:27,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:27,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825933746] [2020-12-09 05:20:27,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:27,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825933746] [2020-12-09 05:20:27,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:27,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:20:27,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32647905] [2020-12-09 05:20:27,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:20:27,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:20:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:27,665 INFO L87 Difference]: Start difference. First operand 34736 states and 49515 transitions. Second operand 5 states. [2020-12-09 05:20:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:28,923 INFO L93 Difference]: Finished difference Result 64876 states and 91797 transitions. [2020-12-09 05:20:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:20:28,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-12-09 05:20:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:28,957 INFO L225 Difference]: With dead ends: 64876 [2020-12-09 05:20:28,957 INFO L226 Difference]: Without dead ends: 40104 [2020-12-09 05:20:28,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:20:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40104 states. [2020-12-09 05:20:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40104 to 34736. [2020-12-09 05:20:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34736 states. [2020-12-09 05:20:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34736 states to 34736 states and 48939 transitions. [2020-12-09 05:20:29,878 INFO L78 Accepts]: Start accepts. Automaton has 34736 states and 48939 transitions. Word has length 91 [2020-12-09 05:20:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:29,878 INFO L481 AbstractCegarLoop]: Abstraction has 34736 states and 48939 transitions. [2020-12-09 05:20:29,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:20:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 34736 states and 48939 transitions. [2020-12-09 05:20:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-09 05:20:29,905 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:29,905 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2020-12-09 05:20:29,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 05:20:29,905 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash -221078283, now seen corresponding path program 1 times [2020-12-09 05:20:29,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:29,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788935984] [2020-12-09 05:20:29,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:29,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788935984] [2020-12-09 05:20:29,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:29,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:29,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658518935] [2020-12-09 05:20:29,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:29,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:29,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:29,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:20:29,945 INFO L87 Difference]: Start difference. First operand 34736 states and 48939 transitions. Second operand 3 states. [2020-12-09 05:20:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:30,706 INFO L93 Difference]: Finished difference Result 61403 states and 86660 transitions. [2020-12-09 05:20:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:30,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-09 05:20:30,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:30,731 INFO L225 Difference]: With dead ends: 61403 [2020-12-09 05:20:30,732 INFO L226 Difference]: Without dead ends: 26719 [2020-12-09 05:20:30,753 INFO L677 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 [2020-12-09 05:20:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26719 states. [2020-12-09 05:20:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26719 to 26526. [2020-12-09 05:20:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26526 states. [2020-12-09 05:20:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26526 states to 26526 states and 36779 transitions. [2020-12-09 05:20:31,471 INFO L78 Accepts]: Start accepts. Automaton has 26526 states and 36779 transitions. Word has length 92 [2020-12-09 05:20:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:31,472 INFO L481 AbstractCegarLoop]: Abstraction has 26526 states and 36779 transitions. [2020-12-09 05:20:31,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:20:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 26526 states and 36779 transitions. [2020-12-09 05:20:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-09 05:20:31,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:31,488 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2020-12-09 05:20:31,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 05:20:31,488 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:31,489 INFO L82 PathProgramCache]: Analyzing trace with hash 752410676, now seen corresponding path program 1 times [2020-12-09 05:20:31,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:31,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114223936] [2020-12-09 05:20:31,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:31,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114223936] [2020-12-09 05:20:31,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209057117] [2020-12-09 05:20:31,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:20:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:31,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:20:31,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:20:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:20:31,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:20:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:20:31,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:20:31,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [8] total 9 [2020-12-09 05:20:31,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494220243] [2020-12-09 05:20:31,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:31,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:20:31,875 INFO L87 Difference]: Start difference. First operand 26526 states and 36779 transitions. Second operand 3 states. [2020-12-09 05:20:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:32,998 INFO L93 Difference]: Finished difference Result 64150 states and 89152 transitions. [2020-12-09 05:20:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:32,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-09 05:20:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:33,086 INFO L225 Difference]: With dead ends: 64150 [2020-12-09 05:20:33,086 INFO L226 Difference]: Without dead ends: 37644 [2020-12-09 05:20:33,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:20:33,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37644 states. [2020-12-09 05:20:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37644 to 37640. [2020-12-09 05:20:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37640 states. [2020-12-09 05:20:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37640 states to 37640 states and 51962 transitions. [2020-12-09 05:20:34,177 INFO L78 Accepts]: Start accepts. Automaton has 37640 states and 51962 transitions. Word has length 92 [2020-12-09 05:20:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:34,177 INFO L481 AbstractCegarLoop]: Abstraction has 37640 states and 51962 transitions. [2020-12-09 05:20:34,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:20:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 37640 states and 51962 transitions. [2020-12-09 05:20:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-09 05:20:34,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:34,234 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2020-12-09 05:20:34,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-09 05:20:34,436 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash 174044771, now seen corresponding path program 1 times [2020-12-09 05:20:34,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:34,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142381190] [2020-12-09 05:20:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:34,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142381190] [2020-12-09 05:20:34,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:34,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:20:34,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411766772] [2020-12-09 05:20:34,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:20:34,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:20:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:34,520 INFO L87 Difference]: Start difference. First operand 37640 states and 51962 transitions. Second operand 5 states. [2020-12-09 05:20:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:35,766 INFO L93 Difference]: Finished difference Result 60005 states and 82119 transitions. [2020-12-09 05:20:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:20:35,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2020-12-09 05:20:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:35,805 INFO L225 Difference]: With dead ends: 60005 [2020-12-09 05:20:35,805 INFO L226 Difference]: Without dead ends: 41177 [2020-12-09 05:20:35,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:20:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41177 states. [2020-12-09 05:20:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41177 to 36856. [2020-12-09 05:20:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36856 states. [2020-12-09 05:20:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36856 states to 36856 states and 50978 transitions. [2020-12-09 05:20:36,923 INFO L78 Accepts]: Start accepts. Automaton has 36856 states and 50978 transitions. Word has length 93 [2020-12-09 05:20:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:36,923 INFO L481 AbstractCegarLoop]: Abstraction has 36856 states and 50978 transitions. [2020-12-09 05:20:36,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:20:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 36856 states and 50978 transitions. [2020-12-09 05:20:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-09 05:20:36,950 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:36,950 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:20:36,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 05:20:36,951 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:36,951 INFO L82 PathProgramCache]: Analyzing trace with hash -11716123, now seen corresponding path program 1 times [2020-12-09 05:20:36,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:36,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639384228] [2020-12-09 05:20:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:37,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639384228] [2020-12-09 05:20:37,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330959498] [2020-12-09 05:20:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:20:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:37,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:20:37,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:20:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:20:37,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:20:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:20:37,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:20:37,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [8] total 9 [2020-12-09 05:20:37,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788745010] [2020-12-09 05:20:37,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:37,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:37,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:37,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:20:37,256 INFO L87 Difference]: Start difference. First operand 36856 states and 50978 transitions. Second operand 3 states. [2020-12-09 05:20:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:39,023 INFO L93 Difference]: Finished difference Result 103488 states and 142934 transitions. [2020-12-09 05:20:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:39,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-12-09 05:20:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:39,090 INFO L225 Difference]: With dead ends: 103488 [2020-12-09 05:20:39,090 INFO L226 Difference]: Without dead ends: 66652 [2020-12-09 05:20:39,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:20:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66652 states. [2020-12-09 05:20:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66652 to 66648. [2020-12-09 05:20:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66648 states. [2020-12-09 05:20:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66648 states to 66648 states and 91329 transitions. [2020-12-09 05:20:41,141 INFO L78 Accepts]: Start accepts. Automaton has 66648 states and 91329 transitions. Word has length 95 [2020-12-09 05:20:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:41,141 INFO L481 AbstractCegarLoop]: Abstraction has 66648 states and 91329 transitions. [2020-12-09 05:20:41,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:20:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 66648 states and 91329 transitions. [2020-12-09 05:20:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-09 05:20:41,196 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:41,196 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:20:41,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:20:41,397 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash -428078727, now seen corresponding path program 1 times [2020-12-09 05:20:41,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:41,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105492979] [2020-12-09 05:20:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:41,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105492979] [2020-12-09 05:20:41,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:41,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:20:41,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575102904] [2020-12-09 05:20:41,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:20:41,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:20:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:20:41,474 INFO L87 Difference]: Start difference. First operand 66648 states and 91329 transitions. Second operand 5 states. [2020-12-09 05:20:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:43,601 INFO L93 Difference]: Finished difference Result 98081 states and 133286 transitions. [2020-12-09 05:20:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:20:43,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-12-09 05:20:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:43,669 INFO L225 Difference]: With dead ends: 98081 [2020-12-09 05:20:43,669 INFO L226 Difference]: Without dead ends: 74877 [2020-12-09 05:20:43,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:20:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74877 states. [2020-12-09 05:20:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74877 to 66248. [2020-12-09 05:20:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66248 states. [2020-12-09 05:20:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66248 states to 66248 states and 90813 transitions. [2020-12-09 05:20:45,855 INFO L78 Accepts]: Start accepts. Automaton has 66248 states and 90813 transitions. Word has length 96 [2020-12-09 05:20:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:45,856 INFO L481 AbstractCegarLoop]: Abstraction has 66248 states and 90813 transitions. [2020-12-09 05:20:45,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:20:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 66248 states and 90813 transitions. [2020-12-09 05:20:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:20:45,906 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:45,907 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-09 05:20:45,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-09 05:20:45,907 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:45,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1710327044, now seen corresponding path program 1 times [2020-12-09 05:20:45,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:45,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90449195] [2020-12-09 05:20:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-09 05:20:45,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90449195] [2020-12-09 05:20:45,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:20:45,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:20:45,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587327724] [2020-12-09 05:20:45,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:20:45,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:20:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:45,943 INFO L87 Difference]: Start difference. First operand 66248 states and 90813 transitions. Second operand 4 states. [2020-12-09 05:20:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:48,965 INFO L93 Difference]: Finished difference Result 175904 states and 240334 transitions. [2020-12-09 05:20:48,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:20:48,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-09 05:20:48,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:49,063 INFO L225 Difference]: With dead ends: 175904 [2020-12-09 05:20:49,063 INFO L226 Difference]: Without dead ends: 109676 [2020-12-09 05:20:49,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:20:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109676 states. [2020-12-09 05:20:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109676 to 88732. [2020-12-09 05:20:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88732 states. [2020-12-09 05:20:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88732 states to 88732 states and 120532 transitions. [2020-12-09 05:20:51,981 INFO L78 Accepts]: Start accepts. Automaton has 88732 states and 120532 transitions. Word has length 98 [2020-12-09 05:20:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:20:51,981 INFO L481 AbstractCegarLoop]: Abstraction has 88732 states and 120532 transitions. [2020-12-09 05:20:51,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:20:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 88732 states and 120532 transitions. [2020-12-09 05:20:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:20:52,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:20:52,031 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-09 05:20:52,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-09 05:20:52,031 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:20:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:20:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1822294122, now seen corresponding path program 2 times [2020-12-09 05:20:52,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:20:52,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77361284] [2020-12-09 05:20:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:20:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:20:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:20:52,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77361284] [2020-12-09 05:20:52,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938816380] [2020-12-09 05:20:52,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:20:52,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 05:20:52,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:20:52,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 05:20:52,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:20:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-09 05:20:52,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:20:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-09 05:20:52,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:20:52,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2020-12-09 05:20:52,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075324526] [2020-12-09 05:20:52,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:20:52,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:20:52,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:20:52,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:20:52,252 INFO L87 Difference]: Start difference. First operand 88732 states and 120532 transitions. Second operand 3 states. [2020-12-09 05:20:56,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:20:56,317 INFO L93 Difference]: Finished difference Result 209140 states and 284122 transitions. [2020-12-09 05:20:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:20:56,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-09 05:20:56,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:20:56,471 INFO L225 Difference]: With dead ends: 209140 [2020-12-09 05:20:56,471 INFO L226 Difference]: Without dead ends: 143144 [2020-12-09 05:20:56,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:20:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143144 states. [2020-12-09 05:21:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143144 to 133672. [2020-12-09 05:21:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133672 states. [2020-12-09 05:21:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133672 states to 133672 states and 179460 transitions. [2020-12-09 05:21:01,302 INFO L78 Accepts]: Start accepts. Automaton has 133672 states and 179460 transitions. Word has length 98 [2020-12-09 05:21:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:21:01,302 INFO L481 AbstractCegarLoop]: Abstraction has 133672 states and 179460 transitions. [2020-12-09 05:21:01,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:21:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 133672 states and 179460 transitions. [2020-12-09 05:21:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:21:01,367 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:21:01,367 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-09 05:21:01,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-09 05:21:01,568 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:21:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:21:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1500998487, now seen corresponding path program 1 times [2020-12-09 05:21:01,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:21:01,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176002562] [2020-12-09 05:21:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:21:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:01,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176002562] [2020-12-09 05:21:01,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014516757] [2020-12-09 05:21:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:21:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:01,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:21:01,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:21:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:01,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:21:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:01,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:21:01,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 05:21:01,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385633075] [2020-12-09 05:21:01,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:21:01,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:21:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:21:01,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:21:01,778 INFO L87 Difference]: Start difference. First operand 133672 states and 179460 transitions. Second operand 4 states. [2020-12-09 05:21:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:21:06,513 INFO L93 Difference]: Finished difference Result 262749 states and 354149 transitions. [2020-12-09 05:21:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:21:06,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-09 05:21:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:21:06,699 INFO L225 Difference]: With dead ends: 262749 [2020-12-09 05:21:06,699 INFO L226 Difference]: Without dead ends: 167725 [2020-12-09 05:21:06,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:21:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167725 states. [2020-12-09 05:21:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167725 to 145736. [2020-12-09 05:21:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145736 states. [2020-12-09 05:21:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145736 states to 145736 states and 196904 transitions. [2020-12-09 05:21:12,097 INFO L78 Accepts]: Start accepts. Automaton has 145736 states and 196904 transitions. Word has length 98 [2020-12-09 05:21:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:21:12,097 INFO L481 AbstractCegarLoop]: Abstraction has 145736 states and 196904 transitions. [2020-12-09 05:21:12,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:21:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 145736 states and 196904 transitions. [2020-12-09 05:21:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:21:12,168 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:21:12,168 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-09 05:21:12,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:21:12,370 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:21:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:21:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1248804822, now seen corresponding path program 1 times [2020-12-09 05:21:12,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:21:12,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200898423] [2020-12-09 05:21:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:21:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:12,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200898423] [2020-12-09 05:21:12,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852003200] [2020-12-09 05:21:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:21:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:12,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:21:12,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:21:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:12,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:21:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:12,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:21:12,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 05:21:12,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486529327] [2020-12-09 05:21:12,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:21:12,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:21:12,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:21:12,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:21:12,602 INFO L87 Difference]: Start difference. First operand 145736 states and 196904 transitions. Second operand 4 states. [2020-12-09 05:21:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:21:18,252 INFO L93 Difference]: Finished difference Result 324736 states and 438716 transitions. [2020-12-09 05:21:18,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:21:18,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-09 05:21:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:21:18,468 INFO L225 Difference]: With dead ends: 324736 [2020-12-09 05:21:18,468 INFO L226 Difference]: Without dead ends: 179052 [2020-12-09 05:21:18,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:21:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179052 states. [2020-12-09 05:21:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179052 to 157362. [2020-12-09 05:21:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157362 states. [2020-12-09 05:21:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157362 states to 157362 states and 213480 transitions. [2020-12-09 05:21:24,456 INFO L78 Accepts]: Start accepts. Automaton has 157362 states and 213480 transitions. Word has length 98 [2020-12-09 05:21:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:21:24,456 INFO L481 AbstractCegarLoop]: Abstraction has 157362 states and 213480 transitions. [2020-12-09 05:21:24,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:21:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 157362 states and 213480 transitions. [2020-12-09 05:21:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:21:24,526 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:21:24,527 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-09 05:21:24,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-12-09 05:21:24,728 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:21:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:21:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1360152078, now seen corresponding path program 1 times [2020-12-09 05:21:24,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:21:24,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253570510] [2020-12-09 05:21:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:21:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:24,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253570510] [2020-12-09 05:21:24,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498905790] [2020-12-09 05:21:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:21:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:24,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:21:24,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:21:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:24,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:21:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:24,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:21:24,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 05:21:24,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718255088] [2020-12-09 05:21:24,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:21:24,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:21:24,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:21:24,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:21:24,926 INFO L87 Difference]: Start difference. First operand 157362 states and 213480 transitions. Second operand 4 states. [2020-12-09 05:21:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:21:30,874 INFO L93 Difference]: Finished difference Result 301843 states and 410081 transitions. [2020-12-09 05:21:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:21:30,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-09 05:21:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:21:31,090 INFO L225 Difference]: With dead ends: 301843 [2020-12-09 05:21:31,090 INFO L226 Difference]: Without dead ends: 191123 [2020-12-09 05:21:31,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:21:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191123 states. [2020-12-09 05:21:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191123 to 173872. [2020-12-09 05:21:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173872 states. [2020-12-09 05:21:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173872 states to 173872 states and 237266 transitions. [2020-12-09 05:21:37,653 INFO L78 Accepts]: Start accepts. Automaton has 173872 states and 237266 transitions. Word has length 98 [2020-12-09 05:21:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:21:37,653 INFO L481 AbstractCegarLoop]: Abstraction has 173872 states and 237266 transitions. [2020-12-09 05:21:37,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:21:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 173872 states and 237266 transitions. [2020-12-09 05:21:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:21:37,726 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:21:37,726 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-09 05:21:37,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:21:37,928 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:21:37,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:21:37,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1954004852, now seen corresponding path program 1 times [2020-12-09 05:21:37,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:21:37,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248412627] [2020-12-09 05:21:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:21:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:37,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248412627] [2020-12-09 05:21:37,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575326426] [2020-12-09 05:21:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:21:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:38,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:21:38,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:21:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:38,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:21:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:38,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:21:38,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 05:21:38,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555233683] [2020-12-09 05:21:38,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:21:38,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:21:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:21:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:21:38,154 INFO L87 Difference]: Start difference. First operand 173872 states and 237266 transitions. Second operand 4 states. [2020-12-09 05:21:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:21:44,517 INFO L93 Difference]: Finished difference Result 363970 states and 497102 transitions. [2020-12-09 05:21:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:21:44,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-09 05:21:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:21:44,733 INFO L225 Difference]: With dead ends: 363970 [2020-12-09 05:21:44,733 INFO L226 Difference]: Without dead ends: 190150 [2020-12-09 05:21:44,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:21:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190150 states. [2020-12-09 05:21:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190150 to 178466. [2020-12-09 05:21:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178466 states. [2020-12-09 05:21:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178466 states to 178466 states and 243964 transitions. [2020-12-09 05:21:51,703 INFO L78 Accepts]: Start accepts. Automaton has 178466 states and 243964 transitions. Word has length 98 [2020-12-09 05:21:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:21:51,704 INFO L481 AbstractCegarLoop]: Abstraction has 178466 states and 243964 transitions. [2020-12-09 05:21:51,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:21:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 178466 states and 243964 transitions. [2020-12-09 05:21:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:21:51,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:21:51,782 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:21:51,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-09 05:21:51,983 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:21:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:21:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1878965634, now seen corresponding path program 1 times [2020-12-09 05:21:51,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:21:51,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253258697] [2020-12-09 05:21:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:21:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:21:52,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253258697] [2020-12-09 05:21:52,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077411142] [2020-12-09 05:21:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:21:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:21:52,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 05:21:52,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:21:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:21:52,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:21:52,266 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 05:21:52,267 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:21:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:21:52,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:21:52,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [8] total 10 [2020-12-09 05:21:52,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046728413] [2020-12-09 05:21:52,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:21:52,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:21:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:21:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:21:52,331 INFO L87 Difference]: Start difference. First operand 178466 states and 243964 transitions. Second operand 4 states. [2020-12-09 05:21:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:21:59,264 INFO L93 Difference]: Finished difference Result 336878 states and 460742 transitions. [2020-12-09 05:21:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:21:59,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-09 05:21:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:21:59,472 INFO L225 Difference]: With dead ends: 336878 [2020-12-09 05:21:59,472 INFO L226 Difference]: Without dead ends: 182510 [2020-12-09 05:21:59,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:21:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182510 states. [2020-12-09 05:22:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182510 to 178466. [2020-12-09 05:22:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178466 states. [2020-12-09 05:22:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178466 states to 178466 states and 242520 transitions. [2020-12-09 05:22:06,819 INFO L78 Accepts]: Start accepts. Automaton has 178466 states and 242520 transitions. Word has length 98 [2020-12-09 05:22:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:22:06,819 INFO L481 AbstractCegarLoop]: Abstraction has 178466 states and 242520 transitions. [2020-12-09 05:22:06,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:22:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 178466 states and 242520 transitions. [2020-12-09 05:22:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-09 05:22:06,896 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:22:06,896 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:22:07,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-09 05:22:07,098 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:22:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:22:07,099 INFO L82 PathProgramCache]: Analyzing trace with hash 175303068, now seen corresponding path program 1 times [2020-12-09 05:22:07,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:22:07,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335036765] [2020-12-09 05:22:07,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:22:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:22:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:22:07,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335036765] [2020-12-09 05:22:07,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:22:07,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 05:22:07,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592560585] [2020-12-09 05:22:07,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:22:07,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:22:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:22:07,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:22:07,181 INFO L87 Difference]: Start difference. First operand 178466 states and 242520 transitions. Second operand 6 states. [2020-12-09 05:22:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:22:16,073 INFO L93 Difference]: Finished difference Result 378529 states and 514635 transitions. [2020-12-09 05:22:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:22:16,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2020-12-09 05:22:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:22:16,282 INFO L225 Difference]: With dead ends: 378529 [2020-12-09 05:22:16,282 INFO L226 Difference]: Without dead ends: 180516 [2020-12-09 05:22:16,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:22:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180516 states. [2020-12-09 05:22:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180516 to 134256. [2020-12-09 05:22:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134256 states. [2020-12-09 05:22:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134256 states to 134256 states and 180012 transitions. [2020-12-09 05:22:22,740 INFO L78 Accepts]: Start accepts. Automaton has 134256 states and 180012 transitions. Word has length 99 [2020-12-09 05:22:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:22:22,740 INFO L481 AbstractCegarLoop]: Abstraction has 134256 states and 180012 transitions. [2020-12-09 05:22:22,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:22:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 134256 states and 180012 transitions. [2020-12-09 05:22:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-09 05:22:22,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:22:22,796 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-12-09 05:22:22,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-09 05:22:22,796 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:22:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:22:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1553383048, now seen corresponding path program 1 times [2020-12-09 05:22:22,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:22:22,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804131264] [2020-12-09 05:22:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:22:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:22:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:22:22,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804131264] [2020-12-09 05:22:22,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:22:22,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:22:22,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567062790] [2020-12-09 05:22:22,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:22:22,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:22:22,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:22:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:22:22,838 INFO L87 Difference]: Start difference. First operand 134256 states and 180012 transitions. Second operand 4 states. [2020-12-09 05:22:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:22:28,796 INFO L93 Difference]: Finished difference Result 268394 states and 359810 transitions. [2020-12-09 05:22:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:22:28,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-09 05:22:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:22:28,943 INFO L225 Difference]: With dead ends: 268394 [2020-12-09 05:22:28,943 INFO L226 Difference]: Without dead ends: 134512 [2020-12-09 05:22:29,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:22:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134512 states. [2020-12-09 05:22:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134512 to 134256. [2020-12-09 05:22:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134256 states. [2020-12-09 05:22:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134256 states to 134256 states and 178578 transitions. [2020-12-09 05:22:35,193 INFO L78 Accepts]: Start accepts. Automaton has 134256 states and 178578 transitions. Word has length 99 [2020-12-09 05:22:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:22:35,193 INFO L481 AbstractCegarLoop]: Abstraction has 134256 states and 178578 transitions. [2020-12-09 05:22:35,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:22:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 134256 states and 178578 transitions. [2020-12-09 05:22:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-09 05:22:35,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:22:35,250 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-12-09 05:22:35,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-09 05:22:35,251 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:22:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:22:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash 653265472, now seen corresponding path program 1 times [2020-12-09 05:22:35,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:22:35,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283923330] [2020-12-09 05:22:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:22:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:22:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:22:35,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283923330] [2020-12-09 05:22:35,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:22:35,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:22:35,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80653790] [2020-12-09 05:22:35,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:22:35,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:22:35,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:22:35,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:22:35,292 INFO L87 Difference]: Start difference. First operand 134256 states and 178578 transitions. Second operand 4 states. [2020-12-09 05:22:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:22:42,871 INFO L93 Difference]: Finished difference Result 294469 states and 391292 transitions. [2020-12-09 05:22:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:22:42,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-09 05:22:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:22:43,034 INFO L225 Difference]: With dead ends: 294469 [2020-12-09 05:22:43,034 INFO L226 Difference]: Without dead ends: 142881 [2020-12-09 05:22:43,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:22:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142881 states. [2020-12-09 05:22:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142881 to 121581. [2020-12-09 05:22:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121581 states. [2020-12-09 05:22:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121581 states to 121581 states and 160737 transitions. [2020-12-09 05:22:49,510 INFO L78 Accepts]: Start accepts. Automaton has 121581 states and 160737 transitions. Word has length 100 [2020-12-09 05:22:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:22:49,510 INFO L481 AbstractCegarLoop]: Abstraction has 121581 states and 160737 transitions. [2020-12-09 05:22:49,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:22:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 121581 states and 160737 transitions. [2020-12-09 05:22:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-09 05:22:49,537 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:22:49,538 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:22:49,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-09 05:22:49,538 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:22:49,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:22:49,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1093127634, now seen corresponding path program 1 times [2020-12-09 05:22:49,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:22:49,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765348383] [2020-12-09 05:22:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:22:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:22:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:22:49,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765348383] [2020-12-09 05:22:49,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:22:49,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:22:49,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614465449] [2020-12-09 05:22:49,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:22:49,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:22:49,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:22:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:22:49,571 INFO L87 Difference]: Start difference. First operand 121581 states and 160737 transitions. Second operand 3 states. [2020-12-09 05:22:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:22:54,904 INFO L93 Difference]: Finished difference Result 235115 states and 311589 transitions. [2020-12-09 05:22:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:22:54,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-09 05:22:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:22:55,042 INFO L225 Difference]: With dead ends: 235115 [2020-12-09 05:22:55,042 INFO L226 Difference]: Without dead ends: 121317 [2020-12-09 05:22:55,109 INFO L677 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 [2020-12-09 05:22:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121317 states. [2020-12-09 05:23:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121317 to 120377. [2020-12-09 05:23:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120377 states. [2020-12-09 05:23:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120377 states to 120377 states and 154805 transitions. [2020-12-09 05:23:00,869 INFO L78 Accepts]: Start accepts. Automaton has 120377 states and 154805 transitions. Word has length 124 [2020-12-09 05:23:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:23:00,869 INFO L481 AbstractCegarLoop]: Abstraction has 120377 states and 154805 transitions. [2020-12-09 05:23:00,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:23:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 120377 states and 154805 transitions. [2020-12-09 05:23:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-09 05:23:00,897 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:23:00,898 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:23:00,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-09 05:23:00,898 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:23:00,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:23:00,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1860516978, now seen corresponding path program 1 times [2020-12-09 05:23:00,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:23:00,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135765432] [2020-12-09 05:23:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:23:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:23:00,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135765432] [2020-12-09 05:23:00,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:23:00,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:23:00,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065991995] [2020-12-09 05:23:00,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:23:00,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:23:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:23:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:23:00,942 INFO L87 Difference]: Start difference. First operand 120377 states and 154805 transitions. Second operand 3 states. [2020-12-09 05:23:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:23:05,236 INFO L93 Difference]: Finished difference Result 199228 states and 256411 transitions. [2020-12-09 05:23:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:23:05,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-09 05:23:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:23:05,325 INFO L225 Difference]: With dead ends: 199228 [2020-12-09 05:23:05,326 INFO L226 Difference]: Without dead ends: 86714 [2020-12-09 05:23:05,397 INFO L677 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 [2020-12-09 05:23:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86714 states. [2020-12-09 05:23:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86714 to 85874. [2020-12-09 05:23:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85874 states. [2020-12-09 05:23:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85874 states to 85874 states and 107941 transitions. [2020-12-09 05:23:09,675 INFO L78 Accepts]: Start accepts. Automaton has 85874 states and 107941 transitions. Word has length 124 [2020-12-09 05:23:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:23:09,676 INFO L481 AbstractCegarLoop]: Abstraction has 85874 states and 107941 transitions. [2020-12-09 05:23:09,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:23:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 85874 states and 107941 transitions. [2020-12-09 05:23:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-09 05:23:09,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:23:09,703 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:23:09,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-09 05:23:09,703 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:23:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:23:09,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1945632695, now seen corresponding path program 1 times [2020-12-09 05:23:09,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:23:09,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564259868] [2020-12-09 05:23:09,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:23:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:09,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564259868] [2020-12-09 05:23:09,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526324207] [2020-12-09 05:23:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:23:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:09,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 05:23:09,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:23:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:09,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:23:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:09,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:23:09,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [3] total 5 [2020-12-09 05:23:09,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516606857] [2020-12-09 05:23:09,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:23:09,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:23:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:23:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:23:09,958 INFO L87 Difference]: Start difference. First operand 85874 states and 107941 transitions. Second operand 4 states. [2020-12-09 05:23:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:23:14,104 INFO L93 Difference]: Finished difference Result 165240 states and 207523 transitions. [2020-12-09 05:23:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:23:14,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2020-12-09 05:23:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:23:14,186 INFO L225 Difference]: With dead ends: 165240 [2020-12-09 05:23:14,186 INFO L226 Difference]: Without dead ends: 87314 [2020-12-09 05:23:14,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:23:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87314 states. [2020-12-09 05:23:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87314 to 85874. [2020-12-09 05:23:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85874 states. [2020-12-09 05:23:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85874 states to 85874 states and 106347 transitions. [2020-12-09 05:23:18,473 INFO L78 Accepts]: Start accepts. Automaton has 85874 states and 106347 transitions. Word has length 125 [2020-12-09 05:23:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:23:18,473 INFO L481 AbstractCegarLoop]: Abstraction has 85874 states and 106347 transitions. [2020-12-09 05:23:18,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:23:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 85874 states and 106347 transitions. [2020-12-09 05:23:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-09 05:23:18,501 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:23:18,501 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:23:18,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:23:18,703 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:23:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:23:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash -158862056, now seen corresponding path program 1 times [2020-12-09 05:23:18,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:23:18,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116980531] [2020-12-09 05:23:18,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:23:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:23:18,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116980531] [2020-12-09 05:23:18,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:23:18,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:23:18,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441960184] [2020-12-09 05:23:18,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:23:18,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:23:18,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:23:18,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:23:18,789 INFO L87 Difference]: Start difference. First operand 85874 states and 106347 transitions. Second operand 4 states. [2020-12-09 05:23:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:23:23,315 INFO L93 Difference]: Finished difference Result 173070 states and 214045 transitions. [2020-12-09 05:23:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:23:23,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-12-09 05:23:23,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:23:23,411 INFO L225 Difference]: With dead ends: 173070 [2020-12-09 05:23:23,412 INFO L226 Difference]: Without dead ends: 95358 [2020-12-09 05:23:23,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:23:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95358 states. [2020-12-09 05:23:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95358 to 79537. [2020-12-09 05:23:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79537 states. [2020-12-09 05:23:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79537 states to 79537 states and 97292 transitions. [2020-12-09 05:23:27,542 INFO L78 Accepts]: Start accepts. Automaton has 79537 states and 97292 transitions. Word has length 128 [2020-12-09 05:23:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:23:27,543 INFO L481 AbstractCegarLoop]: Abstraction has 79537 states and 97292 transitions. [2020-12-09 05:23:27,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:23:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 79537 states and 97292 transitions. [2020-12-09 05:23:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-09 05:23:27,567 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:23:27,567 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:23:27,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-09 05:23:27,567 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:23:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:23:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1421745618, now seen corresponding path program 1 times [2020-12-09 05:23:27,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:23:27,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440371913] [2020-12-09 05:23:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:23:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:27,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440371913] [2020-12-09 05:23:27,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289374780] [2020-12-09 05:23:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:23:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:27,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 05:23:27,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:23:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:27,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:23:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:27,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:23:27,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2020-12-09 05:23:27,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022111630] [2020-12-09 05:23:27,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:23:27,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:23:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:23:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:23:27,861 INFO L87 Difference]: Start difference. First operand 79537 states and 97292 transitions. Second operand 4 states. [2020-12-09 05:23:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:23:31,851 INFO L93 Difference]: Finished difference Result 156798 states and 191373 transitions. [2020-12-09 05:23:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:23:31,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-12-09 05:23:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:23:31,931 INFO L225 Difference]: With dead ends: 156798 [2020-12-09 05:23:31,931 INFO L226 Difference]: Without dead ends: 81621 [2020-12-09 05:23:31,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:23:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81621 states. [2020-12-09 05:23:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81621 to 79537. [2020-12-09 05:23:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79537 states. [2020-12-09 05:23:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79537 states to 79537 states and 95513 transitions. [2020-12-09 05:23:36,118 INFO L78 Accepts]: Start accepts. Automaton has 79537 states and 95513 transitions. Word has length 153 [2020-12-09 05:23:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:23:36,118 INFO L481 AbstractCegarLoop]: Abstraction has 79537 states and 95513 transitions. [2020-12-09 05:23:36,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:23:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 79537 states and 95513 transitions. [2020-12-09 05:23:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-09 05:23:36,142 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:23:36,142 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:23:36,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:23:36,344 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:23:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:23:36,345 INFO L82 PathProgramCache]: Analyzing trace with hash 104571720, now seen corresponding path program 1 times [2020-12-09 05:23:36,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:23:36,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366902647] [2020-12-09 05:23:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:23:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:23:36,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366902647] [2020-12-09 05:23:36,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:23:36,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:23:36,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681119602] [2020-12-09 05:23:36,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:23:36,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:23:36,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:23:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:23:36,408 INFO L87 Difference]: Start difference. First operand 79537 states and 95513 transitions. Second operand 4 states. [2020-12-09 05:23:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:23:42,008 INFO L93 Difference]: Finished difference Result 191293 states and 229555 transitions. [2020-12-09 05:23:42,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:23:42,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2020-12-09 05:23:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:23:42,130 INFO L225 Difference]: With dead ends: 191293 [2020-12-09 05:23:42,131 INFO L226 Difference]: Without dead ends: 116317 [2020-12-09 05:23:42,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:23:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116317 states. [2020-12-09 05:23:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116317 to 98716. [2020-12-09 05:23:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98716 states. [2020-12-09 05:23:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98716 states to 98716 states and 116789 transitions. [2020-12-09 05:23:47,409 INFO L78 Accepts]: Start accepts. Automaton has 98716 states and 116789 transitions. Word has length 157 [2020-12-09 05:23:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:23:47,409 INFO L481 AbstractCegarLoop]: Abstraction has 98716 states and 116789 transitions. [2020-12-09 05:23:47,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:23:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 98716 states and 116789 transitions. [2020-12-09 05:23:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-12-09 05:23:47,431 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:23:47,431 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:23:47,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-09 05:23:47,432 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:23:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:23:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1982478264, now seen corresponding path program 1 times [2020-12-09 05:23:47,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:23:47,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202817466] [2020-12-09 05:23:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:23:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:47,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202817466] [2020-12-09 05:23:47,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78189145] [2020-12-09 05:23:47,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:23:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:47,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 05:23:47,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:23:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 05:23:47,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:23:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 05:23:47,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:23:47,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 5 [2020-12-09 05:23:47,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271122159] [2020-12-09 05:23:47,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:23:47,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:23:47,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:23:47,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:23:47,741 INFO L87 Difference]: Start difference. First operand 98716 states and 116789 transitions. Second operand 3 states. [2020-12-09 05:23:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:23:50,907 INFO L93 Difference]: Finished difference Result 156723 states and 186817 transitions. [2020-12-09 05:23:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:23:50,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2020-12-09 05:23:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:23:50,972 INFO L225 Difference]: With dead ends: 156723 [2020-12-09 05:23:50,972 INFO L226 Difference]: Without dead ends: 58832 [2020-12-09 05:23:51,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:23:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58832 states. [2020-12-09 05:23:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58832 to 58792. [2020-12-09 05:23:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58792 states. [2020-12-09 05:23:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58792 states to 58792 states and 68640 transitions. [2020-12-09 05:23:54,207 INFO L78 Accepts]: Start accepts. Automaton has 58792 states and 68640 transitions. Word has length 183 [2020-12-09 05:23:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:23:54,207 INFO L481 AbstractCegarLoop]: Abstraction has 58792 states and 68640 transitions. [2020-12-09 05:23:54,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:23:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 58792 states and 68640 transitions. [2020-12-09 05:23:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-12-09 05:23:54,220 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:23:54,220 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:23:54,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-09 05:23:54,421 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:23:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:23:54,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2104669912, now seen corresponding path program 1 times [2020-12-09 05:23:54,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:23:54,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495978446] [2020-12-09 05:23:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:23:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:54,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495978446] [2020-12-09 05:23:54,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947399308] [2020-12-09 05:23:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:23:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:23:54,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 05:23:54,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:23:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:54,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:23:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:23:54,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:23:54,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [3] total 5 [2020-12-09 05:23:54,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379028294] [2020-12-09 05:23:54,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:23:54,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:23:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:23:54,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:23:54,795 INFO L87 Difference]: Start difference. First operand 58792 states and 68640 transitions. Second operand 4 states. [2020-12-09 05:23:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:23:58,086 INFO L93 Difference]: Finished difference Result 119222 states and 138543 transitions. [2020-12-09 05:23:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:23:58,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2020-12-09 05:23:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:23:58,147 INFO L225 Difference]: With dead ends: 119222 [2020-12-09 05:23:58,148 INFO L226 Difference]: Without dead ends: 62484 [2020-12-09 05:23:58,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:23:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62484 states. [2020-12-09 05:24:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62484 to 58792. [2020-12-09 05:24:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58792 states. [2020-12-09 05:24:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58792 states to 58792 states and 67321 transitions. [2020-12-09 05:24:01,219 INFO L78 Accepts]: Start accepts. Automaton has 58792 states and 67321 transitions. Word has length 183 [2020-12-09 05:24:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:24:01,219 INFO L481 AbstractCegarLoop]: Abstraction has 58792 states and 67321 transitions. [2020-12-09 05:24:01,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:24:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 58792 states and 67321 transitions. [2020-12-09 05:24:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-09 05:24:01,232 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:24:01,232 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:24:01,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-09 05:24:01,434 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:24:01,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:24:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1957737580, now seen corresponding path program 1 times [2020-12-09 05:24:01,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:24:01,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228980671] [2020-12-09 05:24:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:24:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:24:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:24:01,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228980671] [2020-12-09 05:24:01,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:24:01,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:24:01,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765392013] [2020-12-09 05:24:01,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:24:01,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:24:01,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:24:01,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:24:01,511 INFO L87 Difference]: Start difference. First operand 58792 states and 67321 transitions. Second operand 4 states. [2020-12-09 05:24:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:24:05,173 INFO L93 Difference]: Finished difference Result 127369 states and 145502 transitions. [2020-12-09 05:24:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:24:05,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2020-12-09 05:24:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:24:05,250 INFO L225 Difference]: With dead ends: 127369 [2020-12-09 05:24:05,250 INFO L226 Difference]: Without dead ends: 70778 [2020-12-09 05:24:05,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:24:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70778 states. [2020-12-09 05:24:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70778 to 61807. [2020-12-09 05:24:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61807 states. [2020-12-09 05:24:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61807 states to 61807 states and 69630 transitions. [2020-12-09 05:24:08,651 INFO L78 Accepts]: Start accepts. Automaton has 61807 states and 69630 transitions. Word has length 188 [2020-12-09 05:24:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:24:08,651 INFO L481 AbstractCegarLoop]: Abstraction has 61807 states and 69630 transitions. [2020-12-09 05:24:08,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:24:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 61807 states and 69630 transitions. [2020-12-09 05:24:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-09 05:24:08,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:24:08,664 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:24:08,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-09 05:24:08,664 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:24:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:24:08,664 INFO L82 PathProgramCache]: Analyzing trace with hash -181222634, now seen corresponding path program 1 times [2020-12-09 05:24:08,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:24:08,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176118682] [2020-12-09 05:24:08,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:24:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:24:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:24:08,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176118682] [2020-12-09 05:24:08,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283322155] [2020-12-09 05:24:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:24:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:24:08,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:24:08,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:24:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:24:08,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:24:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:24:09,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:24:09,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 05:24:09,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853330873] [2020-12-09 05:24:09,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:24:09,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:24:09,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:24:09,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:24:09,032 INFO L87 Difference]: Start difference. First operand 61807 states and 69630 transitions. Second operand 4 states. [2020-12-09 05:24:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:24:11,615 INFO L93 Difference]: Finished difference Result 107328 states and 121984 transitions. [2020-12-09 05:24:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:24:11,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2020-12-09 05:24:11,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:24:11,655 INFO L225 Difference]: With dead ends: 107328 [2020-12-09 05:24:11,655 INFO L226 Difference]: Without dead ends: 46485 [2020-12-09 05:24:11,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:24:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2020-12-09 05:24:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42237. [2020-12-09 05:24:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42237 states. [2020-12-09 05:24:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42237 states to 42237 states and 48217 transitions. [2020-12-09 05:24:13,992 INFO L78 Accepts]: Start accepts. Automaton has 42237 states and 48217 transitions. Word has length 215 [2020-12-09 05:24:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:24:13,992 INFO L481 AbstractCegarLoop]: Abstraction has 42237 states and 48217 transitions. [2020-12-09 05:24:13,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:24:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 42237 states and 48217 transitions. [2020-12-09 05:24:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-12-09 05:24:13,998 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:24:13,998 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:24:14,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-09 05:24:14,200 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:24:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:24:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1996754604, now seen corresponding path program 1 times [2020-12-09 05:24:14,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:24:14,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15733733] [2020-12-09 05:24:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:24:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:24:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:24:14,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15733733] [2020-12-09 05:24:14,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:24:14,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 05:24:14,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796591030] [2020-12-09 05:24:14,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 05:24:14,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:24:14,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 05:24:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:24:14,401 INFO L87 Difference]: Start difference. First operand 42237 states and 48217 transitions. Second operand 8 states. [2020-12-09 05:24:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:24:24,047 INFO L93 Difference]: Finished difference Result 202952 states and 230929 transitions. [2020-12-09 05:24:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:24:24,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 220 [2020-12-09 05:24:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:24:24,200 INFO L225 Difference]: With dead ends: 202952 [2020-12-09 05:24:24,200 INFO L226 Difference]: Without dead ends: 167259 [2020-12-09 05:24:24,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:24:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167259 states. [2020-12-09 05:24:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167259 to 117230. [2020-12-09 05:24:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117230 states. [2020-12-09 05:24:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117230 states to 117230 states and 133385 transitions. [2020-12-09 05:24:31,711 INFO L78 Accepts]: Start accepts. Automaton has 117230 states and 133385 transitions. Word has length 220 [2020-12-09 05:24:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:24:31,712 INFO L481 AbstractCegarLoop]: Abstraction has 117230 states and 133385 transitions. [2020-12-09 05:24:31,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 05:24:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 117230 states and 133385 transitions. [2020-12-09 05:24:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-12-09 05:24:31,718 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:24:31,718 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:24:31,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-09 05:24:31,718 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:24:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:24:31,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1817676069, now seen corresponding path program 1 times [2020-12-09 05:24:31,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:24:31,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343223029] [2020-12-09 05:24:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:24:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 05:24:31,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 05:24:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 05:24:31,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 05:24:31,866 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 05:24:31,866 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 05:24:31,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-09 05:24:32,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:24:32 BoogieIcfgContainer [2020-12-09 05:24:32,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:24:32,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:24:32,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:24:32,031 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:24:32,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:20:09" (3/4) ... [2020-12-09 05:24:32,032 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 05:24:32,200 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0da19524-00d6-456e-9032-c5c74d484eab/bin/utaipan/witness.graphml [2020-12-09 05:24:32,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:24:32,202 INFO L168 Benchmark]: Toolchain (without parser) took 264796.04 ms. Allocated memory was 115.3 MB in the beginning and 8.8 GB in the end (delta: 8.6 GB). Free memory was 79.8 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 16.1 GB. [2020-12-09 05:24:32,202 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 73.4 MB. Free memory was 33.0 MB in the beginning and 32.9 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:24:32,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.31 ms. Allocated memory is still 115.3 MB. Free memory was 79.6 MB in the beginning and 83.2 MB in the end (delta: -3.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 05:24:32,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.73 ms. Allocated memory is still 115.3 MB. Free memory was 83.2 MB in the beginning and 78.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 05:24:32,203 INFO L168 Benchmark]: Boogie Preprocessor took 75.61 ms. Allocated memory is still 115.3 MB. Free memory was 78.1 MB in the beginning and 73.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 05:24:32,203 INFO L168 Benchmark]: RCFGBuilder took 2094.82 ms. Allocated memory was 115.3 MB in the beginning and 172.0 MB in the end (delta: 56.6 MB). Free memory was 73.3 MB in the beginning and 78.8 MB in the end (delta: -5.5 MB). Peak memory consumption was 61.2 MB. Max. memory is 16.1 GB. [2020-12-09 05:24:32,203 INFO L168 Benchmark]: TraceAbstraction took 262120.40 ms. Allocated memory was 172.0 MB in the beginning and 8.8 GB in the end (delta: 8.6 GB). Free memory was 78.8 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.8 GB. Max. memory is 16.1 GB. [2020-12-09 05:24:32,203 INFO L168 Benchmark]: Witness Printer took 170.15 ms. Allocated memory is still 8.8 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 56.1 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.1 GB. [2020-12-09 05:24:32,205 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 73.4 MB. Free memory was 33.0 MB in the beginning and 32.9 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 261.31 ms. Allocated memory is still 115.3 MB. Free memory was 79.6 MB in the beginning and 83.2 MB in the end (delta: -3.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 68.73 ms. Allocated memory is still 115.3 MB. Free memory was 83.2 MB in the beginning and 78.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.61 ms. Allocated memory is still 115.3 MB. Free memory was 78.1 MB in the beginning and 73.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2094.82 ms. Allocated memory was 115.3 MB in the beginning and 172.0 MB in the end (delta: 56.6 MB). Free memory was 73.3 MB in the beginning and 78.8 MB in the end (delta: -5.5 MB). Peak memory consumption was 61.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 262120.40 ms. Allocated memory was 172.0 MB in the beginning and 8.8 GB in the end (delta: 8.6 GB). Free memory was 78.8 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.8 GB. Max. memory is 16.1 GB. * Witness Printer took 170.15 ms. Allocated memory is still 8.8 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 56.1 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int t3_pc = 0; [L20] int t4_pc = 0; [L21] int t5_pc = 0; [L22] int m_st ; [L23] int t1_st ; [L24] int t2_st ; [L25] int t3_st ; [L26] int t4_st ; [L27] int t5_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int t2_i ; [L31] int t3_i ; [L32] int t4_i ; [L33] int t5_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int T3_E = 2; [L38] int T4_E = 2; [L39] int T5_E = 2; [L40] int E_M = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L44] int E_4 = 2; [L45] int E_5 = 2; [L53] int token ; [L55] int local ; [L977] int __retres1 ; [L888] m_i = 1 [L889] t1_i = 1 [L890] t2_i = 1 [L891] t3_i = 1 [L892] t4_i = 1 [L893] t5_i = 1 [L918] int kernel_st ; [L919] int tmp ; [L920] int tmp___0 ; [L924] kernel_st = 0 [L418] COND TRUE m_i == 1 [L419] m_st = 0 [L423] COND TRUE t1_i == 1 [L424] t1_st = 0 [L428] COND TRUE t2_i == 1 [L429] t2_st = 0 [L433] COND TRUE t3_i == 1 [L434] t3_st = 0 [L438] COND TRUE t4_i == 1 [L439] t4_st = 0 [L443] COND TRUE t5_i == 1 [L444] t5_st = 0 [L603] COND FALSE !(M_E == 0) [L608] COND FALSE !(T1_E == 0) [L613] COND FALSE !(T2_E == 0) [L618] COND FALSE !(T3_E == 0) [L623] COND FALSE !(T4_E == 0) [L628] COND FALSE !(T5_E == 0) [L633] COND FALSE !(E_M == 0) [L638] COND FALSE !(E_1 == 0) [L643] COND FALSE !(E_2 == 0) [L648] COND FALSE !(E_3 == 0) [L653] COND FALSE !(E_4 == 0) [L658] COND FALSE !(E_5 == 0) [L736] int tmp ; [L737] int tmp___0 ; [L738] int tmp___1 ; [L739] int tmp___2 ; [L740] int tmp___3 ; [L741] int tmp___4 ; [L293] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L296] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L306] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L308] return (__retres1); [L745] tmp = is_master_triggered() [L747] COND FALSE !(\read(tmp)) [L312] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L315] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L325] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L327] return (__retres1); [L753] tmp___0 = is_transmit1_triggered() [L755] COND FALSE !(\read(tmp___0)) [L331] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L334] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L344] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L346] return (__retres1); [L761] tmp___1 = is_transmit2_triggered() [L763] COND FALSE !(\read(tmp___1)) [L350] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L353] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L363] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L365] return (__retres1); [L769] tmp___2 = is_transmit3_triggered() [L771] COND FALSE !(\read(tmp___2)) [L369] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L372] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L382] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L384] return (__retres1); [L777] tmp___3 = is_transmit4_triggered() [L779] COND FALSE !(\read(tmp___3)) [L388] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L391] COND FALSE !(t5_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L401] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L403] return (__retres1); [L785] tmp___4 = is_transmit5_triggered() [L787] COND FALSE !(\read(tmp___4)) [L671] COND FALSE !(M_E == 1) [L676] COND FALSE !(T1_E == 1) [L681] COND FALSE !(T2_E == 1) [L686] COND FALSE !(T3_E == 1) [L691] COND FALSE !(T4_E == 1) [L696] COND FALSE !(T5_E == 1) [L701] COND FALSE !(E_M == 1) [L706] COND FALSE !(E_1 == 1) [L711] COND FALSE !(E_2 == 1) [L716] COND FALSE !(E_3 == 1) [L721] COND FALSE !(E_4 == 1) [L726] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L932] COND TRUE 1 [L935] kernel_st = 1 [L494] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L498] COND TRUE 1 [L453] int __retres1 ; [L456] COND TRUE m_st == 0 [L457] __retres1 = 1 [L489] return (__retres1); [L501] tmp = exists_runnable_thread() [L503] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L508] COND TRUE m_st == 0 [L509] int tmp_ndt_1; [L510] tmp_ndt_1 = __VERIFIER_nondet_int() [L511] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L522] COND TRUE t1_st == 0 [L523] int tmp_ndt_2; [L524] tmp_ndt_2 = __VERIFIER_nondet_int() [L525] COND TRUE \read(tmp_ndt_2) [L527] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L116] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L127] COND TRUE 1 [L129] t1_pc = 1 [L130] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L536] COND TRUE t2_st == 0 [L537] int tmp_ndt_3; [L538] tmp_ndt_3 = __VERIFIER_nondet_int() [L539] COND TRUE \read(tmp_ndt_3) [L541] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L152] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L163] COND TRUE 1 [L165] t2_pc = 1 [L166] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L550] COND TRUE t3_st == 0 [L551] int tmp_ndt_4; [L552] tmp_ndt_4 = __VERIFIER_nondet_int() [L553] COND TRUE \read(tmp_ndt_4) [L555] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L188] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L199] COND TRUE 1 [L201] t3_pc = 1 [L202] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L564] COND TRUE t4_st == 0 [L565] int tmp_ndt_5; [L566] tmp_ndt_5 = __VERIFIER_nondet_int() [L567] COND TRUE \read(tmp_ndt_5) [L569] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L224] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L235] COND TRUE 1 [L237] t4_pc = 1 [L238] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L578] COND TRUE t5_st == 0 [L579] int tmp_ndt_6; [L580] tmp_ndt_6 = __VERIFIER_nondet_int() [L581] COND TRUE \read(tmp_ndt_6) [L583] t5_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1, token=0] [L260] COND TRUE t5_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1, token=0] [L271] COND TRUE 1 [L273] t5_pc = 1 [L274] t5_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L498] COND TRUE 1 [L453] int __retres1 ; [L456] COND TRUE m_st == 0 [L457] __retres1 = 1 [L489] return (__retres1); [L501] tmp = exists_runnable_thread() [L503] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L508] COND TRUE m_st == 0 [L509] int tmp_ndt_1; [L510] tmp_ndt_1 = __VERIFIER_nondet_int() [L511] COND TRUE \read(tmp_ndt_1) [L513] m_st = 1 [L58] int tmp_var = __VERIFIER_nondet_int(); [L60] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L71] COND TRUE 1 [L74] token = __VERIFIER_nondet_int() [L75] local = token [L76] E_1 = 1 [L736] int tmp ; [L737] int tmp___0 ; [L738] int tmp___1 ; [L739] int tmp___2 ; [L740] int tmp___3 ; [L741] int tmp___4 ; [L293] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L296] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L306] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L308] return (__retres1); [L745] tmp = is_master_triggered() [L747] COND FALSE !(\read(tmp)) [L312] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L315] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L316] COND TRUE E_1 == 1 [L317] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L327] return (__retres1); [L753] tmp___0 = is_transmit1_triggered() [L755] COND TRUE \read(tmp___0) [L756] t1_st = 0 [L331] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L334] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L335] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L344] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L346] return (__retres1); [L761] tmp___1 = is_transmit2_triggered() [L763] COND FALSE !(\read(tmp___1)) [L350] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L353] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L354] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L363] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L365] return (__retres1); [L769] tmp___2 = is_transmit3_triggered() [L771] COND FALSE !(\read(tmp___2)) [L369] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L372] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L373] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L382] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L384] return (__retres1); [L777] tmp___3 = is_transmit4_triggered() [L779] COND FALSE !(\read(tmp___3)) [L388] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L391] COND TRUE t5_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L392] COND FALSE !(E_5 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L401] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L403] return (__retres1); [L785] tmp___4 = is_transmit5_triggered() [L787] COND FALSE !(\read(tmp___4)) [L78] E_1 = 2 [L79] m_pc = 1 [L80] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L522] COND TRUE t1_st == 0 [L523] int tmp_ndt_2; [L524] tmp_ndt_2 = __VERIFIER_nondet_int() [L525] COND TRUE \read(tmp_ndt_2) [L527] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L116] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L119] COND TRUE t1_pc == 1 [L135] token += 1 [L136] E_2 = 1 [L736] int tmp ; [L737] int tmp___0 ; [L738] int tmp___1 ; [L739] int tmp___2 ; [L740] int tmp___3 ; [L741] int tmp___4 ; [L293] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L296] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L306] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L308] return (__retres1); [L745] tmp = is_master_triggered() [L747] COND FALSE !(\read(tmp)) [L312] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L315] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L316] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L325] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L327] return (__retres1); [L753] tmp___0 = is_transmit1_triggered() [L755] COND FALSE !(\read(tmp___0)) [L331] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L334] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L335] COND TRUE E_2 == 1 [L336] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L346] return (__retres1); [L761] tmp___1 = is_transmit2_triggered() [L763] COND TRUE \read(tmp___1) [L764] t2_st = 0 [L350] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L353] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L354] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L363] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L365] return (__retres1); [L769] tmp___2 = is_transmit3_triggered() [L771] COND FALSE !(\read(tmp___2)) [L369] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L372] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L373] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L382] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L384] return (__retres1); [L777] tmp___3 = is_transmit4_triggered() [L779] COND FALSE !(\read(tmp___3)) [L388] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L391] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L392] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L401] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L403] return (__retres1); [L785] tmp___4 = is_transmit5_triggered() [L787] COND FALSE !(\read(tmp___4)) [L138] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L127] COND TRUE 1 [L129] t1_pc = 1 [L130] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L536] COND TRUE t2_st == 0 [L537] int tmp_ndt_3; [L538] tmp_ndt_3 = __VERIFIER_nondet_int() [L539] COND TRUE \read(tmp_ndt_3) [L541] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L152] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L155] COND TRUE t2_pc == 1 [L171] token += 1 [L172] E_3 = 1 [L736] int tmp ; [L737] int tmp___0 ; [L738] int tmp___1 ; [L739] int tmp___2 ; [L740] int tmp___3 ; [L741] int tmp___4 ; [L293] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L296] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L306] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L308] return (__retres1); [L745] tmp = is_master_triggered() [L747] COND FALSE !(\read(tmp)) [L312] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L315] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L316] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L325] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L327] return (__retres1); [L753] tmp___0 = is_transmit1_triggered() [L755] COND FALSE !(\read(tmp___0)) [L331] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L334] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L335] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L344] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L346] return (__retres1); [L761] tmp___1 = is_transmit2_triggered() [L763] COND FALSE !(\read(tmp___1)) [L350] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L353] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L354] COND TRUE E_3 == 1 [L355] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L365] return (__retres1); [L769] tmp___2 = is_transmit3_triggered() [L771] COND TRUE \read(tmp___2) [L772] t3_st = 0 [L369] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L372] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L373] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L382] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L384] return (__retres1); [L777] tmp___3 = is_transmit4_triggered() [L779] COND FALSE !(\read(tmp___3)) [L388] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L391] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L392] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L401] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L403] return (__retres1); [L785] tmp___4 = is_transmit5_triggered() [L787] COND FALSE !(\read(tmp___4)) [L174] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L163] COND TRUE 1 [L165] t2_pc = 1 [L166] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L550] COND TRUE t3_st == 0 [L551] int tmp_ndt_4; [L552] tmp_ndt_4 = __VERIFIER_nondet_int() [L553] COND TRUE \read(tmp_ndt_4) [L555] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L188] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L191] COND TRUE t3_pc == 1 [L207] token += 1 [L208] E_4 = 1 [L736] int tmp ; [L737] int tmp___0 ; [L738] int tmp___1 ; [L739] int tmp___2 ; [L740] int tmp___3 ; [L741] int tmp___4 ; [L293] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L296] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L306] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L308] return (__retres1); [L745] tmp = is_master_triggered() [L747] COND FALSE !(\read(tmp)) [L312] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L315] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L316] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L325] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L327] return (__retres1); [L753] tmp___0 = is_transmit1_triggered() [L755] COND FALSE !(\read(tmp___0)) [L331] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L334] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L335] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L344] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L346] return (__retres1); [L761] tmp___1 = is_transmit2_triggered() [L763] COND FALSE !(\read(tmp___1)) [L350] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L353] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L354] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L363] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L365] return (__retres1); [L769] tmp___2 = is_transmit3_triggered() [L771] COND FALSE !(\read(tmp___2)) [L369] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L372] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L373] COND TRUE E_4 == 1 [L374] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L384] return (__retres1); [L777] tmp___3 = is_transmit4_triggered() [L779] COND TRUE \read(tmp___3) [L780] t4_st = 0 [L388] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L391] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L392] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L401] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L403] return (__retres1); [L785] tmp___4 = is_transmit5_triggered() [L787] COND FALSE !(\read(tmp___4)) [L210] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L199] COND TRUE 1 [L201] t3_pc = 1 [L202] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L564] COND TRUE t4_st == 0 [L565] int tmp_ndt_5; [L566] tmp_ndt_5 = __VERIFIER_nondet_int() [L567] COND TRUE \read(tmp_ndt_5) [L569] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L224] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L227] COND TRUE t4_pc == 1 [L243] token += 1 [L244] E_5 = 1 [L736] int tmp ; [L737] int tmp___0 ; [L738] int tmp___1 ; [L739] int tmp___2 ; [L740] int tmp___3 ; [L741] int tmp___4 ; [L293] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L296] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L306] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L308] return (__retres1); [L745] tmp = is_master_triggered() [L747] COND FALSE !(\read(tmp)) [L312] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L315] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L316] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L325] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L327] return (__retres1); [L753] tmp___0 = is_transmit1_triggered() [L755] COND FALSE !(\read(tmp___0)) [L331] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L334] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L335] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L344] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L346] return (__retres1); [L761] tmp___1 = is_transmit2_triggered() [L763] COND FALSE !(\read(tmp___1)) [L350] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L353] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L354] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L363] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L365] return (__retres1); [L769] tmp___2 = is_transmit3_triggered() [L771] COND FALSE !(\read(tmp___2)) [L369] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L372] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L373] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L382] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L384] return (__retres1); [L777] tmp___3 = is_transmit4_triggered() [L779] COND FALSE !(\read(tmp___3)) [L388] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L391] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L392] COND TRUE E_5 == 1 [L393] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L403] return (__retres1); [L785] tmp___4 = is_transmit5_triggered() [L787] COND TRUE \read(tmp___4) [L788] t5_st = 0 [L246] E_5 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=4] [L235] COND TRUE 1 [L237] t4_pc = 1 [L238] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=4] [L578] COND TRUE t5_st == 0 [L579] int tmp_ndt_6; [L580] tmp_ndt_6 = __VERIFIER_nondet_int() [L581] COND TRUE \read(tmp_ndt_6) [L583] t5_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=4] [L260] COND FALSE !(t5_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=4] [L263] COND TRUE t5_pc == 1 [L279] token += 1 [L280] E_M = 1 [L736] int tmp ; [L737] int tmp___0 ; [L738] int tmp___1 ; [L739] int tmp___2 ; [L740] int tmp___3 ; [L741] int tmp___4 ; [L293] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L296] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L297] COND TRUE E_M == 1 [L298] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L308] return (__retres1); [L745] tmp = is_master_triggered() [L747] COND TRUE \read(tmp) [L748] m_st = 0 [L312] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L315] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L316] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L325] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L327] return (__retres1); [L753] tmp___0 = is_transmit1_triggered() [L755] COND FALSE !(\read(tmp___0)) [L331] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L334] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L335] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L344] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L346] return (__retres1); [L761] tmp___1 = is_transmit2_triggered() [L763] COND FALSE !(\read(tmp___1)) [L350] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L353] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L354] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L363] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L365] return (__retres1); [L769] tmp___2 = is_transmit3_triggered() [L771] COND FALSE !(\read(tmp___2)) [L369] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L372] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L373] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L382] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L384] return (__retres1); [L777] tmp___3 = is_transmit4_triggered() [L779] COND FALSE !(\read(tmp___3)) [L388] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L391] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L392] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L401] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L403] return (__retres1); [L785] tmp___4 = is_transmit5_triggered() [L787] COND FALSE !(\read(tmp___4)) [L282] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L271] COND TRUE 1 [L273] t5_pc = 1 [L274] t5_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L498] COND TRUE 1 [L453] int __retres1 ; [L456] COND TRUE m_st == 0 [L457] __retres1 = 1 [L489] return (__retres1); [L501] tmp = exists_runnable_thread() [L503] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L508] COND TRUE m_st == 0 [L509] int tmp_ndt_1; [L510] tmp_ndt_1 = __VERIFIER_nondet_int() [L511] COND TRUE \read(tmp_ndt_1) [L513] m_st = 1 [L58] int tmp_var = __VERIFIER_nondet_int(); [L60] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L63] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L85] COND FALSE !(token != local + 5) [L90] COND TRUE tmp_var <= 5 [L91] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L96] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L97] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L98] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L12] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 264 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 261.9s, OverallIterations: 42, TraceHistogramMax: 3, AutomataDifference: 131.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18618 SDtfs, 27070 SDslu, 26655 SDs, 0 SdLazy, 2248 SolverSat, 703 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3491 GetRequests, 3331 SyntacticMatches, 4 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178466occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 120.7s AutomataMinimizationTime, 41 MinimizatonAttempts, 346555 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 6189 NumberOfCodeBlocks, 6153 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 7533 ConstructedInterpolants, 0 QuantifiedInterpolants, 1972302 SizeOfPredicates, 6 NumberOfNonLiveVariables, 7177 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 67 InterpolantComputations, 54 PerfectInterpolantSequences, 1225/1279 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...