./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.04.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.04.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/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 3723db60962369c4b10118802934116c8cea6114 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-a4ecdab [2020-11-30 01:58:49,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:58:49,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:58:49,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:58:49,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:58:49,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:58:49,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:58:49,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:58:49,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:58:49,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:58:49,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:58:49,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:58:49,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:58:49,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:58:49,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:58:49,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:58:49,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:58:49,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:58:49,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:58:49,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:58:49,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:58:49,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:58:49,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:58:49,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:58:49,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:58:49,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:58:49,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:58:49,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:58:49,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:58:49,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:58:49,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:58:49,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:58:49,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:58:49,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:58:49,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:58:49,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:58:49,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:58:49,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:58:49,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:58:49,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:58:49,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:58:49,741 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 01:58:49,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:58:49,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:58:49,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:58:49,791 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:58:49,791 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:58:49,792 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:58:49,792 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 01:58:49,792 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:58:49,793 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:58:49,793 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 01:58:49,794 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 01:58:49,795 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:58:49,795 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 01:58:49,795 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 01:58:49,796 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 01:58:49,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:58:49,797 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:58:49,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:58:49,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:58:49,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:58:49,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:58:49,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:58:49,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:58:49,799 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:58:49,799 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:58:49,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:58:49,800 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:58:49,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:58:49,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:58:49,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:58:49,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:58:49,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:58:49,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:58:49,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:58:49,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:58:49,806 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 01:58:49,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:58:49,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:58:49,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:58:49,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:58:49,807 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_ec590f61-ce5d-4e1a-825b-ae9deda6061a/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_ec590f61-ce5d-4e1a-825b-ae9deda6061a/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 -> 3723db60962369c4b10118802934116c8cea6114 [2020-11-30 01:58:50,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:58:50,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:58:50,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:58:50,138 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:58:50,139 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:58:50,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/../../sv-benchmarks/c/systemc/transmitter.04.cil.c [2020-11-30 01:58:50,241 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/data/85e761769/e9c54e3984804b578c62a0d00c8fc0a6/FLAGab8fafec0 [2020-11-30 01:58:50,898 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:58:50,899 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/sv-benchmarks/c/systemc/transmitter.04.cil.c [2020-11-30 01:58:50,911 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/data/85e761769/e9c54e3984804b578c62a0d00c8fc0a6/FLAGab8fafec0 [2020-11-30 01:58:51,188 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/data/85e761769/e9c54e3984804b578c62a0d00c8fc0a6 [2020-11-30 01:58:51,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:58:51,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:58:51,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:58:51,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:58:51,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:58:51,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527f9a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51, skipping insertion in model container [2020-11-30 01:58:51,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:58:51,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:58:51,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:58:51,577 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:58:51,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:58:51,719 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:58:51,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51 WrapperNode [2020-11-30 01:58:51,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:58:51,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:58:51,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:58:51,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:58:51,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:58:51,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:58:51,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:58:51,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:58:51,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... [2020-11-30 01:58:51,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:58:51,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:58:51,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:58:51,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:58:51,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/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-11-30 01:58:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:58:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:58:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:58:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:58:55,376 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:58:55,377 INFO L298 CfgBuilder]: Removed 150 assume(true) statements. [2020-11-30 01:58:55,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:58:55 BoogieIcfgContainer [2020-11-30 01:58:55,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:58:55,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:58:55,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:58:55,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:58:55,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:58:51" (1/3) ... [2020-11-30 01:58:55,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7222fa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:58:55, skipping insertion in model container [2020-11-30 01:58:55,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:58:51" (2/3) ... [2020-11-30 01:58:55,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7222fa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:58:55, skipping insertion in model container [2020-11-30 01:58:55,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:58:55" (3/3) ... [2020-11-30 01:58:55,391 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2020-11-30 01:58:55,403 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:58:55,408 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:58:55,421 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:58:55,463 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:58:55,463 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:58:55,464 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:58:55,464 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:58:55,464 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:58:55,464 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:58:55,465 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:58:55,465 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:58:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states. [2020-11-30 01:58:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:58:55,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:58:55,509 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-11-30 01:58:55,509 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:58:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:58:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2032258268, now seen corresponding path program 1 times [2020-11-30 01:58:55,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:58:55,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057050360] [2020-11-30 01:58:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:58:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:58:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:58:55,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057050360] [2020-11-30 01:58:55,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:58:55,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:58:55,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942100499] [2020-11-30 01:58:55,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:58:55,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:58:55,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:58:55,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:58:55,790 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 3 states. [2020-11-30 01:58:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:58:55,976 INFO L93 Difference]: Finished difference Result 481 states and 740 transitions. [2020-11-30 01:58:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:58:55,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 01:58:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:58:56,000 INFO L225 Difference]: With dead ends: 481 [2020-11-30 01:58:56,004 INFO L226 Difference]: Without dead ends: 305 [2020-11-30 01:58:56,012 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-11-30 01:58:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-11-30 01:58:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2020-11-30 01:58:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-11-30 01:58:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 452 transitions. [2020-11-30 01:58:56,077 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 452 transitions. Word has length 28 [2020-11-30 01:58:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:58:56,080 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 452 transitions. [2020-11-30 01:58:56,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:58:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 452 transitions. [2020-11-30 01:58:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:58:56,084 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:58:56,085 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-11-30 01:58:56,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:58:56,085 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:58:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:58:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash 672314051, now seen corresponding path program 1 times [2020-11-30 01:58:56,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:58:56,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024867067] [2020-11-30 01:58:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:58:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:58:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:58:56,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024867067] [2020-11-30 01:58:56,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:58:56,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:58:56,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062008224] [2020-11-30 01:58:56,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:58:56,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:58:56,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:58:56,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:58:56,185 INFO L87 Difference]: Start difference. First operand 302 states and 452 transitions. Second operand 4 states. [2020-11-30 01:58:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:58:56,416 INFO L93 Difference]: Finished difference Result 1071 states and 1593 transitions. [2020-11-30 01:58:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:58:56,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-30 01:58:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:58:56,422 INFO L225 Difference]: With dead ends: 1071 [2020-11-30 01:58:56,422 INFO L226 Difference]: Without dead ends: 771 [2020-11-30 01:58:56,425 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-11-30 01:58:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-11-30 01:58:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 712. [2020-11-30 01:58:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-11-30 01:58:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1036 transitions. [2020-11-30 01:58:56,501 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1036 transitions. Word has length 28 [2020-11-30 01:58:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:58:56,502 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 1036 transitions. [2020-11-30 01:58:56,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:58:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1036 transitions. [2020-11-30 01:58:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:58:56,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:58:56,508 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-11-30 01:58:56,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:58:56,508 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:58:56,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:58:56,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1812665762, now seen corresponding path program 1 times [2020-11-30 01:58:56,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:58:56,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917845120] [2020-11-30 01:58:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:58:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:58:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:58:56,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917845120] [2020-11-30 01:58:56,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:58:56,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:58:56,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266557077] [2020-11-30 01:58:56,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:58:56,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:58:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:58:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:58:56,606 INFO L87 Difference]: Start difference. First operand 712 states and 1036 transitions. Second operand 4 states. [2020-11-30 01:58:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:58:56,783 INFO L93 Difference]: Finished difference Result 2194 states and 3216 transitions. [2020-11-30 01:58:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:58:56,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-30 01:58:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:58:56,794 INFO L225 Difference]: With dead ends: 2194 [2020-11-30 01:58:56,794 INFO L226 Difference]: Without dead ends: 1500 [2020-11-30 01:58:56,800 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-11-30 01:58:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2020-11-30 01:58:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1126. [2020-11-30 01:58:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2020-11-30 01:58:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1648 transitions. [2020-11-30 01:58:56,848 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1648 transitions. Word has length 28 [2020-11-30 01:58:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:58:56,849 INFO L481 AbstractCegarLoop]: Abstraction has 1126 states and 1648 transitions. [2020-11-30 01:58:56,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:58:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1648 transitions. [2020-11-30 01:58:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:58:56,852 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:58:56,852 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, 1] [2020-11-30 01:58:56,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:58:56,852 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:58:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:58:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash -84060079, now seen corresponding path program 1 times [2020-11-30 01:58:56,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:58:56,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958432365] [2020-11-30 01:58:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:58:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:58:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:58:56,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958432365] [2020-11-30 01:58:56,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:58:56,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:58:56,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870396457] [2020-11-30 01:58:56,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:58:56,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:58:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:58:56,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:58:56,978 INFO L87 Difference]: Start difference. First operand 1126 states and 1648 transitions. Second operand 4 states. [2020-11-30 01:58:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:58:57,198 INFO L93 Difference]: Finished difference Result 3180 states and 4675 transitions. [2020-11-30 01:58:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:58:57,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-30 01:58:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:58:57,210 INFO L225 Difference]: With dead ends: 3180 [2020-11-30 01:58:57,211 INFO L226 Difference]: Without dead ends: 2072 [2020-11-30 01:58:57,213 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-11-30 01:58:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2020-11-30 01:58:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1623. [2020-11-30 01:58:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2020-11-30 01:58:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2380 transitions. [2020-11-30 01:58:57,326 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2380 transitions. Word has length 29 [2020-11-30 01:58:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:58:57,327 INFO L481 AbstractCegarLoop]: Abstraction has 1623 states and 2380 transitions. [2020-11-30 01:58:57,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:58:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2380 transitions. [2020-11-30 01:58:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:58:57,329 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:58:57,330 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, 1, 1] [2020-11-30 01:58:57,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:58:57,331 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:58:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:58:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1813719321, now seen corresponding path program 1 times [2020-11-30 01:58:57,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:58:57,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376842382] [2020-11-30 01:58:57,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:58:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:58:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:58:57,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376842382] [2020-11-30 01:58:57,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:58:57,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:58:57,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144519895] [2020-11-30 01:58:57,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:58:57,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:58:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:58:57,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:58:57,439 INFO L87 Difference]: Start difference. First operand 1623 states and 2380 transitions. Second operand 4 states. [2020-11-30 01:58:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:58:57,748 INFO L93 Difference]: Finished difference Result 5634 states and 8251 transitions. [2020-11-30 01:58:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:58:57,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-30 01:58:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:58:57,772 INFO L225 Difference]: With dead ends: 5634 [2020-11-30 01:58:57,773 INFO L226 Difference]: Without dead ends: 4029 [2020-11-30 01:58:57,778 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-11-30 01:58:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2020-11-30 01:58:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 2883. [2020-11-30 01:58:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2020-11-30 01:58:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 4218 transitions. [2020-11-30 01:58:57,938 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 4218 transitions. Word has length 30 [2020-11-30 01:58:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:58:57,939 INFO L481 AbstractCegarLoop]: Abstraction has 2883 states and 4218 transitions. [2020-11-30 01:58:57,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:58:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 4218 transitions. [2020-11-30 01:58:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-30 01:58:57,941 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:58:57,942 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, 1, 1, 1] [2020-11-30 01:58:57,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:58:57,942 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:58:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:58:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1493474303, now seen corresponding path program 1 times [2020-11-30 01:58:57,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:58:57,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123114745] [2020-11-30 01:58:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:58:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:58:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:58:58,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123114745] [2020-11-30 01:58:58,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:58:58,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:58:58,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100340408] [2020-11-30 01:58:58,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:58:58,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:58:58,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:58:58,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:58:58,029 INFO L87 Difference]: Start difference. First operand 2883 states and 4218 transitions. Second operand 3 states. [2020-11-30 01:58:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:58:58,298 INFO L93 Difference]: Finished difference Result 8474 states and 12333 transitions. [2020-11-30 01:58:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:58:58,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-11-30 01:58:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:58:58,327 INFO L225 Difference]: With dead ends: 8474 [2020-11-30 01:58:58,327 INFO L226 Difference]: Without dead ends: 5606 [2020-11-30 01:58:58,332 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-11-30 01:58:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5606 states. [2020-11-30 01:58:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5606 to 5576. [2020-11-30 01:58:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5576 states. [2020-11-30 01:58:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5576 states to 5576 states and 7963 transitions. [2020-11-30 01:58:58,580 INFO L78 Accepts]: Start accepts. Automaton has 5576 states and 7963 transitions. Word has length 31 [2020-11-30 01:58:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:58:58,581 INFO L481 AbstractCegarLoop]: Abstraction has 5576 states and 7963 transitions. [2020-11-30 01:58:58,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:58:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 5576 states and 7963 transitions. [2020-11-30 01:58:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 01:58:58,584 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:58:58,584 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:58:58,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:58:58,584 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:58:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:58:58,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1193949674, now seen corresponding path program 1 times [2020-11-30 01:58:58,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:58:58,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138352685] [2020-11-30 01:58:58,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:58:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:58:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 01:58:58,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138352685] [2020-11-30 01:58:58,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:58:58,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:58:58,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641018134] [2020-11-30 01:58:58,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:58:58,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:58:58,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:58:58,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:58:58,629 INFO L87 Difference]: Start difference. First operand 5576 states and 7963 transitions. Second operand 3 states. [2020-11-30 01:58:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:58:59,038 INFO L93 Difference]: Finished difference Result 15177 states and 21708 transitions. [2020-11-30 01:58:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:58:59,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-11-30 01:58:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:58:59,122 INFO L225 Difference]: With dead ends: 15177 [2020-11-30 01:58:59,123 INFO L226 Difference]: Without dead ends: 9618 [2020-11-30 01:58:59,132 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-11-30 01:58:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2020-11-30 01:58:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 9616. [2020-11-30 01:58:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9616 states. [2020-11-30 01:58:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 13703 transitions. [2020-11-30 01:58:59,606 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 13703 transitions. Word has length 44 [2020-11-30 01:58:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:58:59,607 INFO L481 AbstractCegarLoop]: Abstraction has 9616 states and 13703 transitions. [2020-11-30 01:58:59,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:58:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 13703 transitions. [2020-11-30 01:58:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 01:58:59,611 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:58:59,612 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:58:59,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:58:59,612 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:58:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:58:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1277932988, now seen corresponding path program 1 times [2020-11-30 01:58:59,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:58:59,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686679980] [2020-11-30 01:58:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:58:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:58:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:58:59,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686679980] [2020-11-30 01:58:59,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:58:59,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:58:59,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688747144] [2020-11-30 01:58:59,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:58:59,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:58:59,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:58:59,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:58:59,693 INFO L87 Difference]: Start difference. First operand 9616 states and 13703 transitions. Second operand 3 states. [2020-11-30 01:59:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:00,200 INFO L93 Difference]: Finished difference Result 18054 states and 26064 transitions. [2020-11-30 01:59:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:00,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-30 01:59:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:00,253 INFO L225 Difference]: With dead ends: 18054 [2020-11-30 01:59:00,253 INFO L226 Difference]: Without dead ends: 13105 [2020-11-30 01:59:00,260 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-11-30 01:59:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2020-11-30 01:59:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10420. [2020-11-30 01:59:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10420 states. [2020-11-30 01:59:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10420 states to 10420 states and 14969 transitions. [2020-11-30 01:59:00,738 INFO L78 Accepts]: Start accepts. Automaton has 10420 states and 14969 transitions. Word has length 46 [2020-11-30 01:59:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:00,740 INFO L481 AbstractCegarLoop]: Abstraction has 10420 states and 14969 transitions. [2020-11-30 01:59:00,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 10420 states and 14969 transitions. [2020-11-30 01:59:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-30 01:59:00,762 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:00,763 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:59:00,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:59:00,763 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1350657442, now seen corresponding path program 1 times [2020-11-30 01:59:00,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:00,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067261520] [2020-11-30 01:59:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-30 01:59:00,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067261520] [2020-11-30 01:59:00,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:00,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:59:00,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106982638] [2020-11-30 01:59:00,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:00,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:00,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:00,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:00,844 INFO L87 Difference]: Start difference. First operand 10420 states and 14969 transitions. Second operand 3 states. [2020-11-30 01:59:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:01,395 INFO L93 Difference]: Finished difference Result 25453 states and 36471 transitions. [2020-11-30 01:59:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:01,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-30 01:59:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:01,429 INFO L225 Difference]: With dead ends: 25453 [2020-11-30 01:59:01,429 INFO L226 Difference]: Without dead ends: 15041 [2020-11-30 01:59:01,445 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-11-30 01:59:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15041 states. [2020-11-30 01:59:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15041 to 14958. [2020-11-30 01:59:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14958 states. [2020-11-30 01:59:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14958 states to 14958 states and 21185 transitions. [2020-11-30 01:59:02,075 INFO L78 Accepts]: Start accepts. Automaton has 14958 states and 21185 transitions. Word has length 64 [2020-11-30 01:59:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:02,075 INFO L481 AbstractCegarLoop]: Abstraction has 14958 states and 21185 transitions. [2020-11-30 01:59:02,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 14958 states and 21185 transitions. [2020-11-30 01:59:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-30 01:59:02,098 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:02,098 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:59:02,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:59:02,098 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:02,099 INFO L82 PathProgramCache]: Analyzing trace with hash 605697724, now seen corresponding path program 1 times [2020-11-30 01:59:02,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:02,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335985171] [2020-11-30 01:59:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:02,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335985171] [2020-11-30 01:59:02,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:02,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:02,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729423643] [2020-11-30 01:59:02,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:02,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:02,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:02,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:02,170 INFO L87 Difference]: Start difference. First operand 14958 states and 21185 transitions. Second operand 3 states. [2020-11-30 01:59:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:02,597 INFO L93 Difference]: Finished difference Result 23249 states and 33273 transitions. [2020-11-30 01:59:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:02,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-30 01:59:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:02,634 INFO L225 Difference]: With dead ends: 23249 [2020-11-30 01:59:02,634 INFO L226 Difference]: Without dead ends: 14958 [2020-11-30 01:59:02,646 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-11-30 01:59:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14958 states. [2020-11-30 01:59:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14958 to 14798. [2020-11-30 01:59:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14798 states. [2020-11-30 01:59:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14798 states to 14798 states and 20593 transitions. [2020-11-30 01:59:03,249 INFO L78 Accepts]: Start accepts. Automaton has 14798 states and 20593 transitions. Word has length 64 [2020-11-30 01:59:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:03,249 INFO L481 AbstractCegarLoop]: Abstraction has 14798 states and 20593 transitions. [2020-11-30 01:59:03,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 14798 states and 20593 transitions. [2020-11-30 01:59:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-30 01:59:03,271 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:03,271 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:59:03,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:59:03,272 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1676121403, now seen corresponding path program 1 times [2020-11-30 01:59:03,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:03,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751439025] [2020-11-30 01:59:03,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 01:59:03,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751439025] [2020-11-30 01:59:03,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:03,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:59:03,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645217954] [2020-11-30 01:59:03,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:03,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:03,336 INFO L87 Difference]: Start difference. First operand 14798 states and 20593 transitions. Second operand 3 states. [2020-11-30 01:59:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:03,750 INFO L93 Difference]: Finished difference Result 21741 states and 30235 transitions. [2020-11-30 01:59:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:03,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-30 01:59:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:03,775 INFO L225 Difference]: With dead ends: 21741 [2020-11-30 01:59:03,775 INFO L226 Difference]: Without dead ends: 14897 [2020-11-30 01:59:03,789 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-11-30 01:59:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14897 states. [2020-11-30 01:59:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14897 to 14798. [2020-11-30 01:59:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14798 states. [2020-11-30 01:59:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14798 states to 14798 states and 20422 transitions. [2020-11-30 01:59:04,423 INFO L78 Accepts]: Start accepts. Automaton has 14798 states and 20422 transitions. Word has length 64 [2020-11-30 01:59:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:04,424 INFO L481 AbstractCegarLoop]: Abstraction has 14798 states and 20422 transitions. [2020-11-30 01:59:04,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 14798 states and 20422 transitions. [2020-11-30 01:59:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-30 01:59:04,442 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:04,442 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:59:04,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:59:04,442 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1293249351, now seen corresponding path program 1 times [2020-11-30 01:59:04,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:04,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283748470] [2020-11-30 01:59:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:04,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283748470] [2020-11-30 01:59:04,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:04,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:59:04,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730590718] [2020-11-30 01:59:04,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:59:04,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:59:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:59:04,511 INFO L87 Difference]: Start difference. First operand 14798 states and 20422 transitions. Second operand 4 states. [2020-11-30 01:59:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:05,133 INFO L93 Difference]: Finished difference Result 31461 states and 43150 transitions. [2020-11-30 01:59:05,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:59:05,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-11-30 01:59:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:05,164 INFO L225 Difference]: With dead ends: 31461 [2020-11-30 01:59:05,164 INFO L226 Difference]: Without dead ends: 24617 [2020-11-30 01:59:05,177 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-11-30 01:59:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24617 states. [2020-11-30 01:59:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24617 to 20351. [2020-11-30 01:59:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20351 states. [2020-11-30 01:59:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20351 states to 20351 states and 27676 transitions. [2020-11-30 01:59:05,981 INFO L78 Accepts]: Start accepts. Automaton has 20351 states and 27676 transitions. Word has length 65 [2020-11-30 01:59:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:05,982 INFO L481 AbstractCegarLoop]: Abstraction has 20351 states and 27676 transitions. [2020-11-30 01:59:05,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:59:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 20351 states and 27676 transitions. [2020-11-30 01:59:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-30 01:59:05,996 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:05,996 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:59:05,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:59:05,996 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash -992876611, now seen corresponding path program 1 times [2020-11-30 01:59:05,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:05,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183655566] [2020-11-30 01:59:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:06,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183655566] [2020-11-30 01:59:06,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:06,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:06,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028458450] [2020-11-30 01:59:06,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:06,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:06,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:06,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:06,034 INFO L87 Difference]: Start difference. First operand 20351 states and 27676 transitions. Second operand 3 states. [2020-11-30 01:59:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:06,770 INFO L93 Difference]: Finished difference Result 41734 states and 57181 transitions. [2020-11-30 01:59:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:06,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-11-30 01:59:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:06,795 INFO L225 Difference]: With dead ends: 41734 [2020-11-30 01:59:06,795 INFO L226 Difference]: Without dead ends: 23268 [2020-11-30 01:59:06,814 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-11-30 01:59:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23268 states. [2020-11-30 01:59:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23268 to 21143. [2020-11-30 01:59:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21143 states. [2020-11-30 01:59:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21143 states to 21143 states and 28900 transitions. [2020-11-30 01:59:07,733 INFO L78 Accepts]: Start accepts. Automaton has 21143 states and 28900 transitions. Word has length 66 [2020-11-30 01:59:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:07,733 INFO L481 AbstractCegarLoop]: Abstraction has 21143 states and 28900 transitions. [2020-11-30 01:59:07,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 21143 states and 28900 transitions. [2020-11-30 01:59:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-30 01:59:07,747 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:07,747 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:59:07,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 01:59:07,748 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:07,748 INFO L82 PathProgramCache]: Analyzing trace with hash -25252834, now seen corresponding path program 1 times [2020-11-30 01:59:07,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:07,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742252729] [2020-11-30 01:59:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:59:07,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742252729] [2020-11-30 01:59:07,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524374726] [2020-11-30 01:59:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/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-11-30 01:59:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:07,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:59:07,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:59:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:59:08,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:59:08,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:59:08,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:59:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:59:08,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:59:08,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [5] total 9 [2020-11-30 01:59:08,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435653039] [2020-11-30 01:59:08,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:59:08,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:08,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:59:08,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:59:08,332 INFO L87 Difference]: Start difference. First operand 21143 states and 28900 transitions. Second operand 6 states. [2020-11-30 01:59:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:09,105 INFO L93 Difference]: Finished difference Result 27635 states and 37903 transitions. [2020-11-30 01:59:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:59:09,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2020-11-30 01:59:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:09,140 INFO L225 Difference]: With dead ends: 27635 [2020-11-30 01:59:09,140 INFO L226 Difference]: Without dead ends: 20533 [2020-11-30 01:59:09,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:59:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20533 states. [2020-11-30 01:59:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20533 to 20515. [2020-11-30 01:59:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20515 states. [2020-11-30 01:59:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20515 states to 20515 states and 27946 transitions. [2020-11-30 01:59:09,904 INFO L78 Accepts]: Start accepts. Automaton has 20515 states and 27946 transitions. Word has length 68 [2020-11-30 01:59:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:09,905 INFO L481 AbstractCegarLoop]: Abstraction has 20515 states and 27946 transitions. [2020-11-30 01:59:09,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:59:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 20515 states and 27946 transitions. [2020-11-30 01:59:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-30 01:59:09,944 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:09,944 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:59:10,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-30 01:59:10,170 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash -776757523, now seen corresponding path program 1 times [2020-11-30 01:59:10,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:10,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984262126] [2020-11-30 01:59:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 01:59:10,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984262126] [2020-11-30 01:59:10,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:10,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:59:10,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046277613] [2020-11-30 01:59:10,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:10,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:10,241 INFO L87 Difference]: Start difference. First operand 20515 states and 27946 transitions. Second operand 3 states. [2020-11-30 01:59:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:10,899 INFO L93 Difference]: Finished difference Result 39773 states and 54325 transitions. [2020-11-30 01:59:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:10,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-11-30 01:59:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:10,935 INFO L225 Difference]: With dead ends: 39773 [2020-11-30 01:59:10,936 INFO L226 Difference]: Without dead ends: 20515 [2020-11-30 01:59:10,953 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-11-30 01:59:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20515 states. [2020-11-30 01:59:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20515 to 20515. [2020-11-30 01:59:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20515 states. [2020-11-30 01:59:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20515 states to 20515 states and 27586 transitions. [2020-11-30 01:59:11,756 INFO L78 Accepts]: Start accepts. Automaton has 20515 states and 27586 transitions. Word has length 85 [2020-11-30 01:59:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:11,756 INFO L481 AbstractCegarLoop]: Abstraction has 20515 states and 27586 transitions. [2020-11-30 01:59:11,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 20515 states and 27586 transitions. [2020-11-30 01:59:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-30 01:59:11,771 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:11,771 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:59:11,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:59:11,771 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1261850999, now seen corresponding path program 1 times [2020-11-30 01:59:11,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:11,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529214273] [2020-11-30 01:59:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:11,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529214273] [2020-11-30 01:59:11,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:11,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:59:11,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741947177] [2020-11-30 01:59:11,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:59:11,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:11,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:59:11,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:59:11,872 INFO L87 Difference]: Start difference. First operand 20515 states and 27586 transitions. Second operand 4 states. [2020-11-30 01:59:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:12,994 INFO L93 Difference]: Finished difference Result 44000 states and 59596 transitions. [2020-11-30 01:59:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:59:12,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2020-11-30 01:59:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:13,018 INFO L225 Difference]: With dead ends: 44000 [2020-11-30 01:59:13,018 INFO L226 Difference]: Without dead ends: 21969 [2020-11-30 01:59:13,038 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-11-30 01:59:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21969 states. [2020-11-30 01:59:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21969 to 19945. [2020-11-30 01:59:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19945 states. [2020-11-30 01:59:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19945 states to 19945 states and 26796 transitions. [2020-11-30 01:59:13,599 INFO L78 Accepts]: Start accepts. Automaton has 19945 states and 26796 transitions. Word has length 86 [2020-11-30 01:59:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:13,599 INFO L481 AbstractCegarLoop]: Abstraction has 19945 states and 26796 transitions. [2020-11-30 01:59:13,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:59:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19945 states and 26796 transitions. [2020-11-30 01:59:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 01:59:13,607 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:13,607 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:59:13,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:59:13,608 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash 521703055, now seen corresponding path program 1 times [2020-11-30 01:59:13,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:13,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104508933] [2020-11-30 01:59:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:13,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104508933] [2020-11-30 01:59:13,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:13,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:13,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259754831] [2020-11-30 01:59:13,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:13,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:13,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:13,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:13,689 INFO L87 Difference]: Start difference. First operand 19945 states and 26796 transitions. Second operand 3 states. [2020-11-30 01:59:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:14,499 INFO L93 Difference]: Finished difference Result 41719 states and 56864 transitions. [2020-11-30 01:59:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:14,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-11-30 01:59:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:14,520 INFO L225 Difference]: With dead ends: 41719 [2020-11-30 01:59:14,520 INFO L226 Difference]: Without dead ends: 23900 [2020-11-30 01:59:14,536 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-11-30 01:59:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23900 states. [2020-11-30 01:59:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23900 to 21362. [2020-11-30 01:59:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21362 states. [2020-11-30 01:59:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21362 states to 21362 states and 28987 transitions. [2020-11-30 01:59:15,378 INFO L78 Accepts]: Start accepts. Automaton has 21362 states and 28987 transitions. Word has length 87 [2020-11-30 01:59:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:15,378 INFO L481 AbstractCegarLoop]: Abstraction has 21362 states and 28987 transitions. [2020-11-30 01:59:15,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 21362 states and 28987 transitions. [2020-11-30 01:59:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-30 01:59:15,391 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:15,392 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:59:15,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 01:59:15,392 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1278724414, now seen corresponding path program 1 times [2020-11-30 01:59:15,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:15,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157170327] [2020-11-30 01:59:15,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:15,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157170327] [2020-11-30 01:59:15,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:15,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:15,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101379366] [2020-11-30 01:59:15,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:15,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:15,451 INFO L87 Difference]: Start difference. First operand 21362 states and 28987 transitions. Second operand 3 states. [2020-11-30 01:59:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:16,345 INFO L93 Difference]: Finished difference Result 40628 states and 55356 transitions. [2020-11-30 01:59:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:16,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-11-30 01:59:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:16,367 INFO L225 Difference]: With dead ends: 40628 [2020-11-30 01:59:16,367 INFO L226 Difference]: Without dead ends: 21392 [2020-11-30 01:59:16,382 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-11-30 01:59:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21392 states. [2020-11-30 01:59:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21392 to 21362. [2020-11-30 01:59:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21362 states. [2020-11-30 01:59:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21362 states to 21362 states and 28073 transitions. [2020-11-30 01:59:17,248 INFO L78 Accepts]: Start accepts. Automaton has 21362 states and 28073 transitions. Word has length 107 [2020-11-30 01:59:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:17,249 INFO L481 AbstractCegarLoop]: Abstraction has 21362 states and 28073 transitions. [2020-11-30 01:59:17,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21362 states and 28073 transitions. [2020-11-30 01:59:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-30 01:59:17,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:17,264 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:59:17,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 01:59:17,264 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1698183458, now seen corresponding path program 1 times [2020-11-30 01:59:17,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:17,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510423898] [2020-11-30 01:59:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:17,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510423898] [2020-11-30 01:59:17,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:17,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:17,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873680994] [2020-11-30 01:59:17,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:17,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:17,348 INFO L87 Difference]: Start difference. First operand 21362 states and 28073 transitions. Second operand 3 states. [2020-11-30 01:59:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:17,985 INFO L93 Difference]: Finished difference Result 34336 states and 45326 transitions. [2020-11-30 01:59:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:17,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-11-30 01:59:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:18,002 INFO L225 Difference]: With dead ends: 34336 [2020-11-30 01:59:18,003 INFO L226 Difference]: Without dead ends: 16048 [2020-11-30 01:59:18,014 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-11-30 01:59:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16048 states. [2020-11-30 01:59:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16048 to 15988. [2020-11-30 01:59:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15988 states. [2020-11-30 01:59:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15988 states to 15988 states and 20591 transitions. [2020-11-30 01:59:18,619 INFO L78 Accepts]: Start accepts. Automaton has 15988 states and 20591 transitions. Word has length 107 [2020-11-30 01:59:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:18,619 INFO L481 AbstractCegarLoop]: Abstraction has 15988 states and 20591 transitions. [2020-11-30 01:59:18,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 15988 states and 20591 transitions. [2020-11-30 01:59:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-30 01:59:18,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:18,631 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:59:18,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 01:59:18,632 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1667021719, now seen corresponding path program 1 times [2020-11-30 01:59:18,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:18,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723894942] [2020-11-30 01:59:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 01:59:18,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723894942] [2020-11-30 01:59:18,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930692088] [2020-11-30 01:59:18,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/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-11-30 01:59:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:18,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:59:18,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:59:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 01:59:18,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:59:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 01:59:18,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:59:18,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [3] total 5 [2020-11-30 01:59:18,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422625823] [2020-11-30 01:59:18,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:59:18,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:18,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:59:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:59:18,980 INFO L87 Difference]: Start difference. First operand 15988 states and 20591 transitions. Second operand 4 states. [2020-11-30 01:59:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:19,826 INFO L93 Difference]: Finished difference Result 30252 states and 38936 transitions. [2020-11-30 01:59:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:59:19,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2020-11-30 01:59:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:19,843 INFO L225 Difference]: With dead ends: 30252 [2020-11-30 01:59:19,843 INFO L226 Difference]: Without dead ends: 16390 [2020-11-30 01:59:19,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:59:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16390 states. [2020-11-30 01:59:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16390 to 15988. [2020-11-30 01:59:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15988 states. [2020-11-30 01:59:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15988 states to 15988 states and 20129 transitions. [2020-11-30 01:59:20,479 INFO L78 Accepts]: Start accepts. Automaton has 15988 states and 20129 transitions. Word has length 108 [2020-11-30 01:59:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:20,479 INFO L481 AbstractCegarLoop]: Abstraction has 15988 states and 20129 transitions. [2020-11-30 01:59:20,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:59:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 15988 states and 20129 transitions. [2020-11-30 01:59:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-30 01:59:20,488 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:20,488 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:59:20,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:59:20,689 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:20,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2003876063, now seen corresponding path program 1 times [2020-11-30 01:59:20,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:20,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961115227] [2020-11-30 01:59:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:20,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961115227] [2020-11-30 01:59:20,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:20,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:59:20,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407462382] [2020-11-30 01:59:20,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:59:20,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:20,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:59:20,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:59:20,753 INFO L87 Difference]: Start difference. First operand 15988 states and 20129 transitions. Second operand 4 states. [2020-11-30 01:59:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:21,472 INFO L93 Difference]: Finished difference Result 31419 states and 39961 transitions. [2020-11-30 01:59:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:59:21,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2020-11-30 01:59:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:21,487 INFO L225 Difference]: With dead ends: 31419 [2020-11-30 01:59:21,487 INFO L226 Difference]: Without dead ends: 17557 [2020-11-30 01:59:21,495 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-11-30 01:59:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17557 states. [2020-11-30 01:59:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17557 to 15666. [2020-11-30 01:59:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15666 states. [2020-11-30 01:59:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15666 states to 15666 states and 19683 transitions. [2020-11-30 01:59:21,952 INFO L78 Accepts]: Start accepts. Automaton has 15666 states and 19683 transitions. Word has length 111 [2020-11-30 01:59:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:21,953 INFO L481 AbstractCegarLoop]: Abstraction has 15666 states and 19683 transitions. [2020-11-30 01:59:21,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:59:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15666 states and 19683 transitions. [2020-11-30 01:59:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-30 01:59:21,960 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:21,961 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:59:21,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 01:59:21,961 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:21,961 INFO L82 PathProgramCache]: Analyzing trace with hash -263794945, now seen corresponding path program 1 times [2020-11-30 01:59:21,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:21,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837796403] [2020-11-30 01:59:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:22,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837796403] [2020-11-30 01:59:22,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:22,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:22,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431052336] [2020-11-30 01:59:22,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:22,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:22,012 INFO L87 Difference]: Start difference. First operand 15666 states and 19683 transitions. Second operand 3 states. [2020-11-30 01:59:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:22,688 INFO L93 Difference]: Finished difference Result 32537 states and 41506 transitions. [2020-11-30 01:59:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:22,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-11-30 01:59:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:22,707 INFO L225 Difference]: With dead ends: 32537 [2020-11-30 01:59:22,707 INFO L226 Difference]: Without dead ends: 18171 [2020-11-30 01:59:22,716 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-11-30 01:59:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2020-11-30 01:59:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 16654. [2020-11-30 01:59:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16654 states. [2020-11-30 01:59:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16654 states to 16654 states and 21143 transitions. [2020-11-30 01:59:23,213 INFO L78 Accepts]: Start accepts. Automaton has 16654 states and 21143 transitions. Word has length 112 [2020-11-30 01:59:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:23,214 INFO L481 AbstractCegarLoop]: Abstraction has 16654 states and 21143 transitions. [2020-11-30 01:59:23,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 16654 states and 21143 transitions. [2020-11-30 01:59:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:59:23,221 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:23,221 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:59:23,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 01:59:23,222 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1628786484, now seen corresponding path program 1 times [2020-11-30 01:59:23,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:23,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326360248] [2020-11-30 01:59:23,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:59:23,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326360248] [2020-11-30 01:59:23,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:23,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:23,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935597874] [2020-11-30 01:59:23,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:23,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:23,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:23,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:23,293 INFO L87 Difference]: Start difference. First operand 16654 states and 21143 transitions. Second operand 3 states. [2020-11-30 01:59:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:23,868 INFO L93 Difference]: Finished difference Result 32028 states and 40756 transitions. [2020-11-30 01:59:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:23,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-11-30 01:59:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:23,884 INFO L225 Difference]: With dead ends: 32028 [2020-11-30 01:59:23,884 INFO L226 Difference]: Without dead ends: 16674 [2020-11-30 01:59:23,895 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-11-30 01:59:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16674 states. [2020-11-30 01:59:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16674 to 16654. [2020-11-30 01:59:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16654 states. [2020-11-30 01:59:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16654 states to 16654 states and 20411 transitions. [2020-11-30 01:59:24,413 INFO L78 Accepts]: Start accepts. Automaton has 16654 states and 20411 transitions. Word has length 133 [2020-11-30 01:59:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:24,414 INFO L481 AbstractCegarLoop]: Abstraction has 16654 states and 20411 transitions. [2020-11-30 01:59:24,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 16654 states and 20411 transitions. [2020-11-30 01:59:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:59:24,422 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:24,422 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:59:24,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 01:59:24,422 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1215585098, now seen corresponding path program 1 times [2020-11-30 01:59:24,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:24,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073090288] [2020-11-30 01:59:24,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 01:59:24,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073090288] [2020-11-30 01:59:24,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:24,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:24,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881413660] [2020-11-30 01:59:24,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:24,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:24,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:24,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:24,480 INFO L87 Difference]: Start difference. First operand 16654 states and 20411 transitions. Second operand 3 states. [2020-11-30 01:59:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:25,236 INFO L93 Difference]: Finished difference Result 32008 states and 39272 transitions. [2020-11-30 01:59:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:25,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-11-30 01:59:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:25,257 INFO L225 Difference]: With dead ends: 32008 [2020-11-30 01:59:25,257 INFO L226 Difference]: Without dead ends: 16654 [2020-11-30 01:59:25,269 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-11-30 01:59:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16654 states. [2020-11-30 01:59:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16654 to 16654. [2020-11-30 01:59:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16654 states. [2020-11-30 01:59:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16654 states to 16654 states and 19917 transitions. [2020-11-30 01:59:25,821 INFO L78 Accepts]: Start accepts. Automaton has 16654 states and 19917 transitions. Word has length 133 [2020-11-30 01:59:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:25,821 INFO L481 AbstractCegarLoop]: Abstraction has 16654 states and 19917 transitions. [2020-11-30 01:59:25,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 16654 states and 19917 transitions. [2020-11-30 01:59:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-30 01:59:25,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:25,829 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:59:25,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 01:59:25,829 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:25,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1143624260, now seen corresponding path program 1 times [2020-11-30 01:59:25,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:25,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317127170] [2020-11-30 01:59:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 01:59:25,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317127170] [2020-11-30 01:59:25,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30994079] [2020-11-30 01:59:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/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-11-30 01:59:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:26,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:59:26,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:59:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 01:59:26,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:59:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 01:59:26,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:59:26,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2020-11-30 01:59:26,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531786052] [2020-11-30 01:59:26,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:59:26,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:59:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:59:26,163 INFO L87 Difference]: Start difference. First operand 16654 states and 19917 transitions. Second operand 4 states. [2020-11-30 01:59:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:27,530 INFO L93 Difference]: Finished difference Result 50626 states and 59885 transitions. [2020-11-30 01:59:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:59:27,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-11-30 01:59:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:27,563 INFO L225 Difference]: With dead ends: 50626 [2020-11-30 01:59:27,563 INFO L226 Difference]: Without dead ends: 35432 [2020-11-30 01:59:27,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:59:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35432 states. [2020-11-30 01:59:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35432 to 29812. [2020-11-30 01:59:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29812 states. [2020-11-30 01:59:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29812 states to 29812 states and 35375 transitions. [2020-11-30 01:59:28,651 INFO L78 Accepts]: Start accepts. Automaton has 29812 states and 35375 transitions. Word has length 136 [2020-11-30 01:59:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:28,651 INFO L481 AbstractCegarLoop]: Abstraction has 29812 states and 35375 transitions. [2020-11-30 01:59:28,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:59:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29812 states and 35375 transitions. [2020-11-30 01:59:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-30 01:59:28,664 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:28,664 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:59:28,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-11-30 01:59:28,890 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1433456445, now seen corresponding path program 1 times [2020-11-30 01:59:28,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:28,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573711318] [2020-11-30 01:59:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:59:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 01:59:28,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573711318] [2020-11-30 01:59:28,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:59:28,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:59:28,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107252061] [2020-11-30 01:59:28,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:59:28,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:59:28,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:59:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:59:28,960 INFO L87 Difference]: Start difference. First operand 29812 states and 35375 transitions. Second operand 3 states. [2020-11-30 01:59:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:59:30,625 INFO L93 Difference]: Finished difference Result 68586 states and 81321 transitions. [2020-11-30 01:59:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:59:30,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2020-11-30 01:59:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:59:30,668 INFO L225 Difference]: With dead ends: 68586 [2020-11-30 01:59:30,668 INFO L226 Difference]: Without dead ends: 41338 [2020-11-30 01:59:30,691 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-11-30 01:59:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41338 states. [2020-11-30 01:59:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41338 to 39002. [2020-11-30 01:59:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39002 states. [2020-11-30 01:59:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39002 states to 39002 states and 45187 transitions. [2020-11-30 01:59:32,165 INFO L78 Accepts]: Start accepts. Automaton has 39002 states and 45187 transitions. Word has length 136 [2020-11-30 01:59:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:59:32,165 INFO L481 AbstractCegarLoop]: Abstraction has 39002 states and 45187 transitions. [2020-11-30 01:59:32,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:59:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 39002 states and 45187 transitions. [2020-11-30 01:59:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-30 01:59:32,180 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:59:32,180 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:59:32,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-30 01:59:32,180 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:59:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:59:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash -861105685, now seen corresponding path program 1 times [2020-11-30 01:59:32,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:59:32,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878642411] [2020-11-30 01:59:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:59:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:59:32,208 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:59:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:59:32,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:59:32,355 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 01:59:32,355 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:59:32,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-30 01:59:32,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:59:32 BoogieIcfgContainer [2020-11-30 01:59:32,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:59:32,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:59:32,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:59:32,591 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:59:32,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:58:55" (3/4) ... [2020-11-30 01:59:32,594 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:59:32,805 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ec590f61-ce5d-4e1a-825b-ae9deda6061a/bin/utaipan/witness.graphml [2020-11-30 01:59:32,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:59:32,807 INFO L168 Benchmark]: Toolchain (without parser) took 41609.52 ms. Allocated memory was 98.6 MB in the beginning and 5.1 GB in the end (delta: 5.0 GB). Free memory was 68.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.1 GB. [2020-11-30 01:59:32,807 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 98.6 MB. Free memory is still 55.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:59:32,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.85 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 68.4 MB in the beginning and 95.8 MB in the end (delta: -27.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:59:32,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.08 ms. Allocated memory is still 123.7 MB. Free memory was 95.8 MB in the beginning and 91.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:59:32,809 INFO L168 Benchmark]: Boogie Preprocessor took 90.40 ms. Allocated memory is still 123.7 MB. Free memory was 91.4 MB in the beginning and 87.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:59:32,810 INFO L168 Benchmark]: RCFGBuilder took 3426.07 ms. Allocated memory was 123.7 MB in the beginning and 151.0 MB in the end (delta: 27.3 MB). Free memory was 87.4 MB in the beginning and 77.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 69.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:59:32,810 INFO L168 Benchmark]: TraceAbstraction took 37207.35 ms. Allocated memory was 151.0 MB in the beginning and 5.1 GB in the end (delta: 5.0 GB). Free memory was 76.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.1 GB. [2020-11-30 01:59:32,810 INFO L168 Benchmark]: Witness Printer took 214.47 ms. Allocated memory is still 5.1 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:59:32,813 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.31 ms. Allocated memory is still 98.6 MB. Free memory is still 55.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 514.85 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 68.4 MB in the beginning and 95.8 MB in the end (delta: -27.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 142.08 ms. Allocated memory is still 123.7 MB. Free memory was 95.8 MB in the beginning and 91.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 90.40 ms. Allocated memory is still 123.7 MB. Free memory was 91.4 MB in the beginning and 87.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3426.07 ms. Allocated memory was 123.7 MB in the beginning and 151.0 MB in the end (delta: 27.3 MB). Free memory was 87.4 MB in the beginning and 77.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 69.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 37207.35 ms. Allocated memory was 151.0 MB in the beginning and 5.1 GB in the end (delta: 5.0 GB). Free memory was 76.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.1 GB. * Witness Printer took 214.47 ms. Allocated memory is still 5.1 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int t4_pc = 0; [L22] int m_st ; [L23] int t1_st ; [L24] int t2_st ; [L25] int t3_st ; [L26] int t4_st ; [L27] int m_i ; [L28] int t1_i ; [L29] int t2_i ; [L30] int t3_i ; [L31] int t4_i ; [L32] int M_E = 2; [L33] int T1_E = 2; [L34] int T2_E = 2; [L35] int T3_E = 2; [L36] int T4_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L39] int E_3 = 2; [L40] int E_4 = 2; [L813] int __retres1 ; [L725] m_i = 1 [L726] t1_i = 1 [L727] t2_i = 1 [L728] t3_i = 1 [L729] t4_i = 1 [L754] int kernel_st ; [L755] int tmp ; [L756] int tmp___0 ; [L760] kernel_st = 0 [L333] COND TRUE m_i == 1 [L334] m_st = 0 [L338] COND TRUE t1_i == 1 [L339] t1_st = 0 [L343] COND TRUE t2_i == 1 [L344] t2_st = 0 [L348] COND TRUE t3_i == 1 [L349] t3_st = 0 [L353] COND TRUE t4_i == 1 [L354] t4_st = 0 [L494] COND FALSE !(M_E == 0) [L499] COND FALSE !(T1_E == 0) [L504] COND FALSE !(T2_E == 0) [L509] COND FALSE !(T3_E == 0) [L514] COND FALSE !(T4_E == 0) [L519] COND FALSE !(E_1 == 0) [L524] COND FALSE !(E_2 == 0) [L529] COND FALSE !(E_3 == 0) [L534] COND FALSE !(E_4 == 0) [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L230] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L249] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L268] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L287] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L297] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L306] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L316] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) [L547] COND FALSE !(M_E == 1) [L552] COND FALSE !(T1_E == 1) [L557] COND FALSE !(T2_E == 1) [L562] COND FALSE !(T3_E == 1) [L567] COND FALSE !(T4_E == 1) [L572] COND FALSE !(E_1 == 1) [L577] COND FALSE !(E_2 == 1) [L582] COND FALSE !(E_3 == 1) [L587] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L768] COND TRUE 1 [L771] kernel_st = 1 [L399] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L403] COND TRUE 1 [L363] int __retres1 ; [L366] COND TRUE m_st == 0 [L367] __retres1 = 1 [L394] return (__retres1); [L406] tmp = exists_runnable_thread() [L408] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L413] COND TRUE m_st == 0 [L414] int tmp_ndt_1; [L415] tmp_ndt_1 = __VERIFIER_nondet_int() [L416] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, 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] [L427] COND TRUE t1_st == 0 [L428] int tmp_ndt_2; [L429] tmp_ndt_2 = __VERIFIER_nondet_int() [L430] COND TRUE \read(tmp_ndt_2) [L432] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, 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] [L92] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, 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] [L103] COND TRUE 1 [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L441] COND TRUE t2_st == 0 [L442] int tmp_ndt_3; [L443] tmp_ndt_3 = __VERIFIER_nondet_int() [L444] COND TRUE \read(tmp_ndt_3) [L446] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L127] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L138] COND TRUE 1 [L140] t2_pc = 1 [L141] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L455] COND TRUE t3_st == 0 [L456] int tmp_ndt_4; [L457] tmp_ndt_4 = __VERIFIER_nondet_int() [L458] COND TRUE \read(tmp_ndt_4) [L460] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L162] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L173] COND TRUE 1 [L175] t3_pc = 1 [L176] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L469] COND TRUE t4_st == 0 [L470] int tmp_ndt_5; [L471] tmp_ndt_5 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp_ndt_5) [L474] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L197] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L208] COND TRUE 1 [L210] t4_pc = 1 [L211] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L403] COND TRUE 1 [L363] int __retres1 ; [L366] COND TRUE m_st == 0 [L367] __retres1 = 1 [L394] return (__retres1); [L406] tmp = exists_runnable_thread() [L408] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L413] COND TRUE m_st == 0 [L414] int tmp_ndt_1; [L415] tmp_ndt_1 = __VERIFIER_nondet_int() [L416] COND TRUE \read(tmp_ndt_1) [L418] m_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L51] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L62] COND TRUE 1 [L65] E_1 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L230] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L240] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L249] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L250] COND TRUE E_1 == 1 [L251] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, 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] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND TRUE \read(tmp___0) [L616] t1_st = 0 [L265] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L268] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L269] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L278] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) [L284] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L287] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L288] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L297] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) [L303] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L306] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L307] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L316] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) [L67] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L70] COND TRUE 1 [L72] m_pc = 1 [L73] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, 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] [L427] COND TRUE t1_st == 0 [L428] int tmp_ndt_2; [L429] tmp_ndt_2 = __VERIFIER_nondet_int() [L430] COND TRUE \read(tmp_ndt_2) [L432] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L95] COND TRUE t1_pc == 1 [L111] E_2 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L240] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L259] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L269] COND TRUE E_2 == 1 [L270] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND TRUE \read(tmp___1) [L624] t2_st = 0 [L284] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L288] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L297] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) [L303] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L307] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L316] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) [L113] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, 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] [L103] COND TRUE 1 [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L441] COND TRUE t2_st == 0 [L442] int tmp_ndt_3; [L443] tmp_ndt_3 = __VERIFIER_nondet_int() [L444] COND TRUE \read(tmp_ndt_3) [L446] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L127] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L130] COND TRUE t2_pc == 1 [L146] E_3 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L269] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L288] COND TRUE E_3 == 1 [L289] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND TRUE \read(tmp___2) [L632] t3_st = 0 [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L307] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L316] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) [L148] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L138] COND TRUE 1 [L140] t2_pc = 1 [L141] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L455] COND TRUE t3_st == 0 [L456] int tmp_ndt_4; [L457] tmp_ndt_4 = __VERIFIER_nondet_int() [L458] COND TRUE \read(tmp_ndt_4) [L460] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L162] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L165] COND TRUE t3_pc == 1 [L181] E_4 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L269] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L288] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L297] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L307] COND TRUE E_4 == 1 [L308] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND TRUE \read(tmp___3) [L640] t4_st = 0 [L183] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L173] COND TRUE 1 [L175] t3_pc = 1 [L176] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L469] COND TRUE t4_st == 0 [L470] int tmp_ndt_5; [L471] tmp_ndt_5 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp_ndt_5) [L474] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L197] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L200] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L3] __assert_fail("0", "transmitter.04.cil.c", 3, "reach_error") VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 178 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.8s, OverallIterations: 27, TraceHistogramMax: 3, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8324 SDtfs, 7077 SDslu, 5910 SDs, 0 SdLazy, 703 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 710 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39002occurred 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: 14.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 27937 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2447 NumberOfCodeBlocks, 2447 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2588 ConstructedInterpolants, 0 QuantifiedInterpolants, 471236 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1384 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 32 InterpolantComputations, 29 PerfectInterpolantSequences, 420/428 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...