./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 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.04.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/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-7b2dab5 [2020-12-09 08:08:24,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 08:08:24,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 08:08:24,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 08:08:24,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 08:08:24,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 08:08:24,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 08:08:24,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 08:08:24,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 08:08:24,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 08:08:24,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 08:08:24,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 08:08:24,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 08:08:24,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 08:08:24,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 08:08:24,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 08:08:24,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 08:08:24,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 08:08:24,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 08:08:24,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 08:08:24,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 08:08:24,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 08:08:24,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 08:08:24,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 08:08:24,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 08:08:24,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 08:08:24,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 08:08:24,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 08:08:24,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 08:08:24,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 08:08:24,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 08:08:24,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 08:08:24,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 08:08:24,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 08:08:24,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 08:08:24,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 08:08:24,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 08:08:24,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 08:08:24,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 08:08:24,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 08:08:24,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 08:08:24,674 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 08:08:24,694 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 08:08:24,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 08:08:24,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 08:08:24,695 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 08:08:24,696 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 08:08:24,696 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 08:08:24,696 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 08:08:24,696 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 08:08:24,696 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 08:08:24,696 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 08:08:24,696 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 08:08:24,696 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 08:08:24,697 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 08:08:24,697 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 08:08:24,697 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 08:08:24,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 08:08:24,697 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 08:08:24,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 08:08:24,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 08:08:24,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 08:08:24,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 08:08:24,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 08:08:24,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 08:08:24,698 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 08:08:24,698 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 08:08:24,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 08:08:24,699 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 08:08:24,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 08:08:24,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 08:08:24,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 08:08:24,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:08:24,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 08:08:24,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 08:08:24,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 08:08:24,700 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 08:08:24,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 08:08:24,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 08:08:24,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 08:08:24,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 08:08:24,700 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_32d54e00-b1ce-48b7-8be1-75bb37f2682a/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_32d54e00-b1ce-48b7-8be1-75bb37f2682a/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-12-09 08:08:24,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 08:08:24,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 08:08:24,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 08:08:24,881 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 08:08:24,882 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 08:08:24,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/../../sv-benchmarks/c/systemc/transmitter.04.cil.c [2020-12-09 08:08:24,923 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/data/a5e6b6b8d/0d0f790c77fa4284afa1d4295f041e42/FLAGa94bdc0da [2020-12-09 08:08:25,319 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 08:08:25,319 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/sv-benchmarks/c/systemc/transmitter.04.cil.c [2020-12-09 08:08:25,329 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/data/a5e6b6b8d/0d0f790c77fa4284afa1d4295f041e42/FLAGa94bdc0da [2020-12-09 08:08:25,339 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/data/a5e6b6b8d/0d0f790c77fa4284afa1d4295f041e42 [2020-12-09 08:08:25,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 08:08:25,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 08:08:25,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 08:08:25,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 08:08:25,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 08:08:25,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161f68be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25, skipping insertion in model container [2020-12-09 08:08:25,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 08:08:25,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 08:08:25,464 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/sv-benchmarks/c/systemc/transmitter.04.cil.c[401,414] [2020-12-09 08:08:25,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:08:25,526 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 08:08:25,534 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/sv-benchmarks/c/systemc/transmitter.04.cil.c[401,414] [2020-12-09 08:08:25,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:08:25,577 INFO L208 MainTranslator]: Completed translation [2020-12-09 08:08:25,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25 WrapperNode [2020-12-09 08:08:25,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 08:08:25,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 08:08:25,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 08:08:25,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 08:08:25,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 08:08:25,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 08:08:25,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 08:08:25,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 08:08:25,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... [2020-12-09 08:08:25,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 08:08:25,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 08:08:25,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 08:08:25,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 08:08:25,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:08:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 08:08:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 08:08:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 08:08:25,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 08:08:27,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 08:08:27,247 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2020-12-09 08:08:27,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:08:27 BoogieIcfgContainer [2020-12-09 08:08:27,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 08:08:27,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 08:08:27,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 08:08:27,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 08:08:27,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:08:25" (1/3) ... [2020-12-09 08:08:27,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba2bbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:08:27, skipping insertion in model container [2020-12-09 08:08:27,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:08:25" (2/3) ... [2020-12-09 08:08:27,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba2bbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:08:27, skipping insertion in model container [2020-12-09 08:08:27,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:08:27" (3/3) ... [2020-12-09 08:08:27,257 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2020-12-09 08:08:27,270 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 08:08:27,273 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 08:08:27,282 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 08:08:27,299 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 08:08:27,299 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 08:08:27,300 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 08:08:27,300 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 08:08:27,300 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 08:08:27,300 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 08:08:27,300 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 08:08:27,300 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 08:08:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states. [2020-12-09 08:08:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 08:08:27,316 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:27,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:08:27,317 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:27,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash -448255132, now seen corresponding path program 1 times [2020-12-09 08:08:27,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:27,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458756741] [2020-12-09 08:08:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:27,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458756741] [2020-12-09 08:08:27,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:27,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:08:27,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540264100] [2020-12-09 08:08:27,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:08:27,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:27,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:08:27,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:27,469 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 3 states. [2020-12-09 08:08:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:27,536 INFO L93 Difference]: Finished difference Result 481 states and 740 transitions. [2020-12-09 08:08:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:08:27,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-09 08:08:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:27,548 INFO L225 Difference]: With dead ends: 481 [2020-12-09 08:08:27,548 INFO L226 Difference]: Without dead ends: 305 [2020-12-09 08:08:27,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-12-09 08:08:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2020-12-09 08:08:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-12-09 08:08:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 452 transitions. [2020-12-09 08:08:27,593 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 452 transitions. Word has length 28 [2020-12-09 08:08:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:27,593 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 452 transitions. [2020-12-09 08:08:27,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:08:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 452 transitions. [2020-12-09 08:08:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 08:08:27,594 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:27,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:08:27,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 08:08:27,594 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:27,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2038650109, now seen corresponding path program 1 times [2020-12-09 08:08:27,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:27,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457686048] [2020-12-09 08:08:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:27,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457686048] [2020-12-09 08:08:27,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:27,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:27,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880137766] [2020-12-09 08:08:27,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:08:27,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:27,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:08:27,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:27,644 INFO L87 Difference]: Start difference. First operand 302 states and 452 transitions. Second operand 4 states. [2020-12-09 08:08:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:27,779 INFO L93 Difference]: Finished difference Result 1071 states and 1593 transitions. [2020-12-09 08:08:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:08:27,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-12-09 08:08:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:27,785 INFO L225 Difference]: With dead ends: 1071 [2020-12-09 08:08:27,785 INFO L226 Difference]: Without dead ends: 771 [2020-12-09 08:08:27,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:08:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-12-09 08:08:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 712. [2020-12-09 08:08:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-12-09 08:08:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1036 transitions. [2020-12-09 08:08:27,826 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1036 transitions. Word has length 28 [2020-12-09 08:08:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:27,826 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 1036 transitions. [2020-12-09 08:08:27,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:08:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1036 transitions. [2020-12-09 08:08:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 08:08:27,827 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:27,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:08:27,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 08:08:27,827 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -898298398, now seen corresponding path program 1 times [2020-12-09 08:08:27,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:27,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773487681] [2020-12-09 08:08:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:27,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773487681] [2020-12-09 08:08:27,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:27,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:27,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3131285] [2020-12-09 08:08:27,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:08:27,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:08:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:27,894 INFO L87 Difference]: Start difference. First operand 712 states and 1036 transitions. Second operand 4 states. [2020-12-09 08:08:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:28,024 INFO L93 Difference]: Finished difference Result 2194 states and 3216 transitions. [2020-12-09 08:08:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:08:28,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-12-09 08:08:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:28,031 INFO L225 Difference]: With dead ends: 2194 [2020-12-09 08:08:28,031 INFO L226 Difference]: Without dead ends: 1500 [2020-12-09 08:08:28,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2020-12-09 08:08:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1126. [2020-12-09 08:08:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2020-12-09 08:08:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1648 transitions. [2020-12-09 08:08:28,067 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1648 transitions. Word has length 28 [2020-12-09 08:08:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:28,067 INFO L481 AbstractCegarLoop]: Abstraction has 1126 states and 1648 transitions. [2020-12-09 08:08:28,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:08:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1648 transitions. [2020-12-09 08:08:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 08:08:28,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:28,068 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-12-09 08:08:28,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 08:08:28,069 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:28,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1775396881, now seen corresponding path program 1 times [2020-12-09 08:08:28,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:28,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195375378] [2020-12-09 08:08:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:28,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195375378] [2020-12-09 08:08:28,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:28,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:28,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079501089] [2020-12-09 08:08:28,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:08:28,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:28,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:08:28,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:28,119 INFO L87 Difference]: Start difference. First operand 1126 states and 1648 transitions. Second operand 4 states. [2020-12-09 08:08:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:28,262 INFO L93 Difference]: Finished difference Result 3180 states and 4675 transitions. [2020-12-09 08:08:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:08:28,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-12-09 08:08:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:28,275 INFO L225 Difference]: With dead ends: 3180 [2020-12-09 08:08:28,275 INFO L226 Difference]: Without dead ends: 2072 [2020-12-09 08:08:28,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2020-12-09 08:08:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1623. [2020-12-09 08:08:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2020-12-09 08:08:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2380 transitions. [2020-12-09 08:08:28,352 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2380 transitions. Word has length 29 [2020-12-09 08:08:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:28,352 INFO L481 AbstractCegarLoop]: Abstraction has 1623 states and 2380 transitions. [2020-12-09 08:08:28,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:08:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2380 transitions. [2020-12-09 08:08:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 08:08:28,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:28,353 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-12-09 08:08:28,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 08:08:28,354 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash -5128409, now seen corresponding path program 1 times [2020-12-09 08:08:28,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:28,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428994514] [2020-12-09 08:08:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:28,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428994514] [2020-12-09 08:08:28,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:28,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:28,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66525944] [2020-12-09 08:08:28,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:08:28,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:28,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:08:28,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:28,398 INFO L87 Difference]: Start difference. First operand 1623 states and 2380 transitions. Second operand 4 states. [2020-12-09 08:08:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:28,579 INFO L93 Difference]: Finished difference Result 5634 states and 8251 transitions. [2020-12-09 08:08:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:08:28,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-12-09 08:08:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:28,596 INFO L225 Difference]: With dead ends: 5634 [2020-12-09 08:08:28,596 INFO L226 Difference]: Without dead ends: 4029 [2020-12-09 08:08:28,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2020-12-09 08:08:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 2883. [2020-12-09 08:08:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2020-12-09 08:08:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 4218 transitions. [2020-12-09 08:08:28,691 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 4218 transitions. Word has length 30 [2020-12-09 08:08:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:28,691 INFO L481 AbstractCegarLoop]: Abstraction has 2883 states and 4218 transitions. [2020-12-09 08:08:28,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:08:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 4218 transitions. [2020-12-09 08:08:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 08:08:28,692 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:28,693 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-12-09 08:08:28,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 08:08:28,693 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1725217727, now seen corresponding path program 1 times [2020-12-09 08:08:28,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:28,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160597969] [2020-12-09 08:08:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:28,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160597969] [2020-12-09 08:08:28,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:28,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:08:28,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925274142] [2020-12-09 08:08:28,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:08:28,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:28,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:08:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:28,728 INFO L87 Difference]: Start difference. First operand 2883 states and 4218 transitions. Second operand 3 states. [2020-12-09 08:08:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:28,934 INFO L93 Difference]: Finished difference Result 8474 states and 12333 transitions. [2020-12-09 08:08:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:08:28,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-12-09 08:08:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:28,966 INFO L225 Difference]: With dead ends: 8474 [2020-12-09 08:08:28,966 INFO L226 Difference]: Without dead ends: 5606 [2020-12-09 08:08:28,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5606 states. [2020-12-09 08:08:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5606 to 5576. [2020-12-09 08:08:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5576 states. [2020-12-09 08:08:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5576 states to 5576 states and 7963 transitions. [2020-12-09 08:08:29,180 INFO L78 Accepts]: Start accepts. Automaton has 5576 states and 7963 transitions. Word has length 31 [2020-12-09 08:08:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:29,180 INFO L481 AbstractCegarLoop]: Abstraction has 5576 states and 7963 transitions. [2020-12-09 08:08:29,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:08:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5576 states and 7963 transitions. [2020-12-09 08:08:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 08:08:29,182 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:29,182 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-12-09 08:08:29,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 08:08:29,183 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:29,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:29,183 INFO L82 PathProgramCache]: Analyzing trace with hash 731620022, now seen corresponding path program 1 times [2020-12-09 08:08:29,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:29,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3694870] [2020-12-09 08:08:29,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:08:29,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3694870] [2020-12-09 08:08:29,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:29,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:08:29,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857799053] [2020-12-09 08:08:29,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:08:29,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:29,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:08:29,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:29,216 INFO L87 Difference]: Start difference. First operand 5576 states and 7963 transitions. Second operand 3 states. [2020-12-09 08:08:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:29,432 INFO L93 Difference]: Finished difference Result 15177 states and 21708 transitions. [2020-12-09 08:08:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:08:29,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-09 08:08:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:29,483 INFO L225 Difference]: With dead ends: 15177 [2020-12-09 08:08:29,483 INFO L226 Difference]: Without dead ends: 9618 [2020-12-09 08:08:29,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2020-12-09 08:08:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 9616. [2020-12-09 08:08:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9616 states. [2020-12-09 08:08:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 13703 transitions. [2020-12-09 08:08:29,738 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 13703 transitions. Word has length 44 [2020-12-09 08:08:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:29,738 INFO L481 AbstractCegarLoop]: Abstraction has 9616 states and 13703 transitions. [2020-12-09 08:08:29,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:08:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 13703 transitions. [2020-12-09 08:08:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 08:08:29,740 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:29,741 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-12-09 08:08:29,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 08:08:29,741 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:29,741 INFO L82 PathProgramCache]: Analyzing trace with hash 156779932, now seen corresponding path program 1 times [2020-12-09 08:08:29,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:29,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423729739] [2020-12-09 08:08:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:29,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423729739] [2020-12-09 08:08:29,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:29,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:29,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903495158] [2020-12-09 08:08:29,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:08:29,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:29,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:08:29,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:29,774 INFO L87 Difference]: Start difference. First operand 9616 states and 13703 transitions. Second operand 3 states. [2020-12-09 08:08:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:30,082 INFO L93 Difference]: Finished difference Result 18054 states and 26064 transitions. [2020-12-09 08:08:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:08:30,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-09 08:08:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:30,114 INFO L225 Difference]: With dead ends: 18054 [2020-12-09 08:08:30,115 INFO L226 Difference]: Without dead ends: 13105 [2020-12-09 08:08:30,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2020-12-09 08:08:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10420. [2020-12-09 08:08:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10420 states. [2020-12-09 08:08:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10420 states to 10420 states and 14969 transitions. [2020-12-09 08:08:30,455 INFO L78 Accepts]: Start accepts. Automaton has 10420 states and 14969 transitions. Word has length 46 [2020-12-09 08:08:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:30,456 INFO L481 AbstractCegarLoop]: Abstraction has 10420 states and 14969 transitions. [2020-12-09 08:08:30,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:08:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 10420 states and 14969 transitions. [2020-12-09 08:08:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-09 08:08:30,472 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:30,473 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-12-09 08:08:30,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 08:08:30,473 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 935466596, now seen corresponding path program 1 times [2020-12-09 08:08:30,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:30,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354696268] [2020-12-09 08:08:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:08:30,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354696268] [2020-12-09 08:08:30,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:30,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:08:30,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958754768] [2020-12-09 08:08:30,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:08:30,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:08:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:30,518 INFO L87 Difference]: Start difference. First operand 10420 states and 14969 transitions. Second operand 3 states. [2020-12-09 08:08:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:30,828 INFO L93 Difference]: Finished difference Result 25453 states and 36471 transitions. [2020-12-09 08:08:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:08:30,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-09 08:08:30,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:30,846 INFO L225 Difference]: With dead ends: 25453 [2020-12-09 08:08:30,846 INFO L226 Difference]: Without dead ends: 15041 [2020-12-09 08:08:30,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15041 states. [2020-12-09 08:08:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15041 to 14958. [2020-12-09 08:08:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14958 states. [2020-12-09 08:08:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14958 states to 14958 states and 21185 transitions. [2020-12-09 08:08:31,213 INFO L78 Accepts]: Start accepts. Automaton has 14958 states and 21185 transitions. Word has length 64 [2020-12-09 08:08:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:31,214 INFO L481 AbstractCegarLoop]: Abstraction has 14958 states and 21185 transitions. [2020-12-09 08:08:31,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:08:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 14958 states and 21185 transitions. [2020-12-09 08:08:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-09 08:08:31,228 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:31,228 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-12-09 08:08:31,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 08:08:31,228 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1391550689, now seen corresponding path program 1 times [2020-12-09 08:08:31,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:31,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274841341] [2020-12-09 08:08:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:31,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274841341] [2020-12-09 08:08:31,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:31,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:31,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413379845] [2020-12-09 08:08:31,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:08:31,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:31,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:08:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:31,283 INFO L87 Difference]: Start difference. First operand 14958 states and 21185 transitions. Second operand 3 states. [2020-12-09 08:08:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:31,598 INFO L93 Difference]: Finished difference Result 23249 states and 33273 transitions. [2020-12-09 08:08:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:08:31,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-09 08:08:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:31,620 INFO L225 Difference]: With dead ends: 23249 [2020-12-09 08:08:31,620 INFO L226 Difference]: Without dead ends: 14958 [2020-12-09 08:08:31,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:31,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14958 states. [2020-12-09 08:08:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14958 to 14798. [2020-12-09 08:08:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14798 states. [2020-12-09 08:08:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14798 states to 14798 states and 20593 transitions. [2020-12-09 08:08:31,981 INFO L78 Accepts]: Start accepts. Automaton has 14798 states and 20593 transitions. Word has length 64 [2020-12-09 08:08:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:31,981 INFO L481 AbstractCegarLoop]: Abstraction has 14798 states and 20593 transitions. [2020-12-09 08:08:31,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:08:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 14798 states and 20593 transitions. [2020-12-09 08:08:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-09 08:08:31,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:31,991 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-12-09 08:08:31,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 08:08:31,991 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -321127010, now seen corresponding path program 1 times [2020-12-09 08:08:31,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:31,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795535186] [2020-12-09 08:08:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:08:32,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795535186] [2020-12-09 08:08:32,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:32,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:32,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139501289] [2020-12-09 08:08:32,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:08:32,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:08:32,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:32,033 INFO L87 Difference]: Start difference. First operand 14798 states and 20593 transitions. Second operand 4 states. [2020-12-09 08:08:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:32,567 INFO L93 Difference]: Finished difference Result 29297 states and 41268 transitions. [2020-12-09 08:08:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:08:32,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-12-09 08:08:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:32,587 INFO L225 Difference]: With dead ends: 29297 [2020-12-09 08:08:32,588 INFO L226 Difference]: Without dead ends: 22453 [2020-12-09 08:08:32,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22453 states. [2020-12-09 08:08:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22453 to 14798. [2020-12-09 08:08:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14798 states. [2020-12-09 08:08:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14798 states to 14798 states and 20422 transitions. [2020-12-09 08:08:33,074 INFO L78 Accepts]: Start accepts. Automaton has 14798 states and 20422 transitions. Word has length 64 [2020-12-09 08:08:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:33,074 INFO L481 AbstractCegarLoop]: Abstraction has 14798 states and 20422 transitions. [2020-12-09 08:08:33,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:08:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 14798 states and 20422 transitions. [2020-12-09 08:08:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-09 08:08:33,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:33,084 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-12-09 08:08:33,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 08:08:33,085 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1899133956, now seen corresponding path program 1 times [2020-12-09 08:08:33,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:33,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593026356] [2020-12-09 08:08:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:33,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593026356] [2020-12-09 08:08:33,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:33,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:08:33,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465423729] [2020-12-09 08:08:33,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:08:33,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:08:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:33,125 INFO L87 Difference]: Start difference. First operand 14798 states and 20422 transitions. Second operand 4 states. [2020-12-09 08:08:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:33,752 INFO L93 Difference]: Finished difference Result 31461 states and 43150 transitions. [2020-12-09 08:08:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:08:33,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-12-09 08:08:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:33,771 INFO L225 Difference]: With dead ends: 31461 [2020-12-09 08:08:33,771 INFO L226 Difference]: Without dead ends: 24617 [2020-12-09 08:08:33,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24617 states. [2020-12-09 08:08:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24617 to 20351. [2020-12-09 08:08:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20351 states. [2020-12-09 08:08:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20351 states to 20351 states and 27676 transitions. [2020-12-09 08:08:34,264 INFO L78 Accepts]: Start accepts. Automaton has 20351 states and 27676 transitions. Word has length 65 [2020-12-09 08:08:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:34,265 INFO L481 AbstractCegarLoop]: Abstraction has 20351 states and 27676 transitions. [2020-12-09 08:08:34,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:08:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 20351 states and 27676 transitions. [2020-12-09 08:08:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-09 08:08:34,276 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:34,276 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-12-09 08:08:34,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 08:08:34,277 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash -102446973, now seen corresponding path program 1 times [2020-12-09 08:08:34,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:34,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374508347] [2020-12-09 08:08:34,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:08:34,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374508347] [2020-12-09 08:08:34,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:34,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:34,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789639625] [2020-12-09 08:08:34,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:08:34,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:08:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:34,301 INFO L87 Difference]: Start difference. First operand 20351 states and 27676 transitions. Second operand 3 states. [2020-12-09 08:08:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:34,830 INFO L93 Difference]: Finished difference Result 41734 states and 57181 transitions. [2020-12-09 08:08:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:08:34,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-09 08:08:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:34,848 INFO L225 Difference]: With dead ends: 41734 [2020-12-09 08:08:34,848 INFO L226 Difference]: Without dead ends: 23268 [2020-12-09 08:08:34,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23268 states. [2020-12-09 08:08:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23268 to 21143. [2020-12-09 08:08:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21143 states. [2020-12-09 08:08:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21143 states to 21143 states and 28900 transitions. [2020-12-09 08:08:35,534 INFO L78 Accepts]: Start accepts. Automaton has 21143 states and 28900 transitions. Word has length 66 [2020-12-09 08:08:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:35,535 INFO L481 AbstractCegarLoop]: Abstraction has 21143 states and 28900 transitions. [2020-12-09 08:08:35,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:08:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 21143 states and 28900 transitions. [2020-12-09 08:08:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-09 08:08:35,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:35,548 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-12-09 08:08:35,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 08:08:35,548 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1242173219, now seen corresponding path program 1 times [2020-12-09 08:08:35,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:35,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144845204] [2020-12-09 08:08:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:08:35,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144845204] [2020-12-09 08:08:35,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191604372] [2020-12-09 08:08:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:08:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:35,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-09 08:08:35,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:08:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:08:35,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:08:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:08:35,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342499574] [2020-12-09 08:08:35,930 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2020-12-09 08:08:35,930 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:08:35,935 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:08:35,940 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:08:35,940 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:08:37,694 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:08:38,555 WARN L197 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 170 [2020-12-09 08:08:38,748 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2020-12-09 08:08:38,962 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2020-12-09 08:08:39,194 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2020-12-09 08:08:39,471 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2020-12-09 08:08:39,747 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 110 [2020-12-09 08:08:40,075 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2020-12-09 08:08:40,401 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 116 [2020-12-09 08:08:40,818 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 118 [2020-12-09 08:08:41,187 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 122 [2020-12-09 08:08:41,674 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 124 [2020-12-09 08:08:42,027 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-12-09 08:08:43,752 WARN L197 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 197 DAG size of output: 177 [2020-12-09 08:08:45,925 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 182 DAG size of output: 180 [2020-12-09 08:08:46,592 WARN L197 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 153 [2020-12-09 08:08:46,999 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2020-12-09 08:08:47,711 WARN L197 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 154 [2020-12-09 08:08:48,110 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-12-09 08:08:48,812 WARN L197 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2020-12-09 08:08:49,213 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-12-09 08:08:49,927 WARN L197 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 156 [2020-12-09 08:08:50,373 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-12-09 08:08:51,138 WARN L197 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 157 [2020-12-09 08:08:51,593 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-12-09 08:08:52,065 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-12-09 08:08:52,809 WARN L197 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 165 [2020-12-09 08:08:53,795 WARN L197 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 172 [2020-12-09 08:08:53,798 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:08:53,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:08:53,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2020-12-09 08:08:53,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486169095] [2020-12-09 08:08:53,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 08:08:53,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:53,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 08:08:53,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=1008, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 08:08:53,800 INFO L87 Difference]: Start difference. First operand 21143 states and 28900 transitions. Second operand 11 states. [2020-12-09 08:08:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:56,232 INFO L93 Difference]: Finished difference Result 64683 states and 89448 transitions. [2020-12-09 08:08:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-09 08:08:56,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-12-09 08:08:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:56,284 INFO L225 Difference]: With dead ends: 64683 [2020-12-09 08:08:56,284 INFO L226 Difference]: Without dead ends: 43556 [2020-12-09 08:08:56,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1351, Invalid=3479, Unknown=0, NotChecked=0, Total=4830 [2020-12-09 08:08:56,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43556 states. [2020-12-09 08:08:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43556 to 17085. [2020-12-09 08:08:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17085 states. [2020-12-09 08:08:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17085 states to 17085 states and 23741 transitions. [2020-12-09 08:08:57,016 INFO L78 Accepts]: Start accepts. Automaton has 17085 states and 23741 transitions. Word has length 68 [2020-12-09 08:08:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:57,016 INFO L481 AbstractCegarLoop]: Abstraction has 17085 states and 23741 transitions. [2020-12-09 08:08:57,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 08:08:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17085 states and 23741 transitions. [2020-12-09 08:08:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-09 08:08:57,041 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:57,041 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 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] [2020-12-09 08:08:57,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-09 08:08:57,243 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1530473059, now seen corresponding path program 1 times [2020-12-09 08:08:57,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:57,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721803417] [2020-12-09 08:08:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-09 08:08:57,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721803417] [2020-12-09 08:08:57,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:57,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:08:57,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322667340] [2020-12-09 08:08:57,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:08:57,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:08:57,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:57,314 INFO L87 Difference]: Start difference. First operand 17085 states and 23741 transitions. Second operand 4 states. [2020-12-09 08:08:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:58,237 INFO L93 Difference]: Finished difference Result 44369 states and 62019 transitions. [2020-12-09 08:08:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:08:58,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-09 08:08:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:08:58,266 INFO L225 Difference]: With dead ends: 44369 [2020-12-09 08:08:58,266 INFO L226 Difference]: Without dead ends: 27301 [2020-12-09 08:08:58,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:08:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27301 states. [2020-12-09 08:08:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27301 to 22467. [2020-12-09 08:08:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2020-12-09 08:08:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 30982 transitions. [2020-12-09 08:08:59,107 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 30982 transitions. Word has length 81 [2020-12-09 08:08:59,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:08:59,107 INFO L481 AbstractCegarLoop]: Abstraction has 22467 states and 30982 transitions. [2020-12-09 08:08:59,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:08:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 30982 transitions. [2020-12-09 08:08:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-09 08:08:59,115 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:08:59,115 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 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] [2020-12-09 08:08:59,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-12-09 08:08:59,115 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:08:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:08:59,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1262157733, now seen corresponding path program 2 times [2020-12-09 08:08:59,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:08:59,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276278760] [2020-12-09 08:08:59,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:08:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:08:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 08:08:59,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276278760] [2020-12-09 08:08:59,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:08:59,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:08:59,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309319044] [2020-12-09 08:08:59,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:08:59,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:08:59,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:08:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:08:59,142 INFO L87 Difference]: Start difference. First operand 22467 states and 30982 transitions. Second operand 3 states. [2020-12-09 08:08:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:08:59,976 INFO L93 Difference]: Finished difference Result 42711 states and 58690 transitions. [2020-12-09 08:08:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:08:59,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-12-09 08:08:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:00,000 INFO L225 Difference]: With dead ends: 42711 [2020-12-09 08:09:00,000 INFO L226 Difference]: Without dead ends: 25435 [2020-12-09 08:09:00,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25435 states. [2020-12-09 08:09:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25435 to 22373. [2020-12-09 08:09:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22373 states. [2020-12-09 08:09:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22373 states to 22373 states and 30730 transitions. [2020-12-09 08:09:00,846 INFO L78 Accepts]: Start accepts. Automaton has 22373 states and 30730 transitions. Word has length 81 [2020-12-09 08:09:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:00,846 INFO L481 AbstractCegarLoop]: Abstraction has 22373 states and 30730 transitions. [2020-12-09 08:09:00,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:09:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 22373 states and 30730 transitions. [2020-12-09 08:09:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-09 08:09:00,854 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:00,854 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-12-09 08:09:00,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-12-09 08:09:00,854 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:00,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:00,854 INFO L82 PathProgramCache]: Analyzing trace with hash 558710314, now seen corresponding path program 1 times [2020-12-09 08:09:00,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:00,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103251798] [2020-12-09 08:09:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:09:00,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103251798] [2020-12-09 08:09:00,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:00,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:09:00,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481096856] [2020-12-09 08:09:00,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:09:00,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:09:00,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:00,887 INFO L87 Difference]: Start difference. First operand 22373 states and 30730 transitions. Second operand 3 states. [2020-12-09 08:09:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:01,734 INFO L93 Difference]: Finished difference Result 44659 states and 61351 transitions. [2020-12-09 08:09:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:09:01,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-09 08:09:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:01,753 INFO L225 Difference]: With dead ends: 44659 [2020-12-09 08:09:01,753 INFO L226 Difference]: Without dead ends: 22373 [2020-12-09 08:09:01,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22373 states. [2020-12-09 08:09:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22373 to 22373. [2020-12-09 08:09:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22373 states. [2020-12-09 08:09:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22373 states to 22373 states and 30386 transitions. [2020-12-09 08:09:02,561 INFO L78 Accepts]: Start accepts. Automaton has 22373 states and 30386 transitions. Word has length 85 [2020-12-09 08:09:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:02,561 INFO L481 AbstractCegarLoop]: Abstraction has 22373 states and 30386 transitions. [2020-12-09 08:09:02,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:09:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22373 states and 30386 transitions. [2020-12-09 08:09:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-09 08:09:02,570 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:02,570 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-12-09 08:09:02,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-12-09 08:09:02,570 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -340057428, now seen corresponding path program 1 times [2020-12-09 08:09:02,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:02,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858470771] [2020-12-09 08:09:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:02,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858470771] [2020-12-09 08:09:02,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:02,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:09:02,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40020322] [2020-12-09 08:09:02,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:09:02,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:09:02,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:09:02,611 INFO L87 Difference]: Start difference. First operand 22373 states and 30386 transitions. Second operand 4 states. [2020-12-09 08:09:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:03,691 INFO L93 Difference]: Finished difference Result 50227 states and 68419 transitions. [2020-12-09 08:09:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:09:03,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2020-12-09 08:09:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:03,715 INFO L225 Difference]: With dead ends: 50227 [2020-12-09 08:09:03,715 INFO L226 Difference]: Without dead ends: 27941 [2020-12-09 08:09:03,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:09:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27941 states. [2020-12-09 08:09:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27941 to 25027. [2020-12-09 08:09:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25027 states. [2020-12-09 08:09:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25027 states to 25027 states and 33856 transitions. [2020-12-09 08:09:04,707 INFO L78 Accepts]: Start accepts. Automaton has 25027 states and 33856 transitions. Word has length 86 [2020-12-09 08:09:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:04,707 INFO L481 AbstractCegarLoop]: Abstraction has 25027 states and 33856 transitions. [2020-12-09 08:09:04,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:09:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 25027 states and 33856 transitions. [2020-12-09 08:09:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-09 08:09:04,715 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:04,715 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:09:04,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-12-09 08:09:04,715 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1351806985, now seen corresponding path program 1 times [2020-12-09 08:09:04,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:04,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201381374] [2020-12-09 08:09:04,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:04,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201381374] [2020-12-09 08:09:04,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:04,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:09:04,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755032195] [2020-12-09 08:09:04,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:09:04,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:04,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:09:04,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:04,740 INFO L87 Difference]: Start difference. First operand 25027 states and 33856 transitions. Second operand 3 states. [2020-12-09 08:09:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:05,703 INFO L93 Difference]: Finished difference Result 44730 states and 60535 transitions. [2020-12-09 08:09:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:09:05,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-09 08:09:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:05,722 INFO L225 Difference]: With dead ends: 44730 [2020-12-09 08:09:05,722 INFO L226 Difference]: Without dead ends: 25191 [2020-12-09 08:09:05,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25191 states. [2020-12-09 08:09:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25191 to 25027. [2020-12-09 08:09:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25027 states. [2020-12-09 08:09:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25027 states to 25027 states and 32842 transitions. [2020-12-09 08:09:06,669 INFO L78 Accepts]: Start accepts. Automaton has 25027 states and 32842 transitions. Word has length 86 [2020-12-09 08:09:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:06,669 INFO L481 AbstractCegarLoop]: Abstraction has 25027 states and 32842 transitions. [2020-12-09 08:09:06,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:09:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 25027 states and 32842 transitions. [2020-12-09 08:09:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-09 08:09:06,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:06,676 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-12-09 08:09:06,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-12-09 08:09:06,677 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:06,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1833251882, now seen corresponding path program 1 times [2020-12-09 08:09:06,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:06,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561761314] [2020-12-09 08:09:06,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:06,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561761314] [2020-12-09 08:09:06,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:06,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:09:06,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045499124] [2020-12-09 08:09:06,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:09:06,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:06,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:09:06,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:06,700 INFO L87 Difference]: Start difference. First operand 25027 states and 32842 transitions. Second operand 3 states. [2020-12-09 08:09:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:07,799 INFO L93 Difference]: Finished difference Result 50777 states and 67340 transitions. [2020-12-09 08:09:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:09:07,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-09 08:09:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:07,826 INFO L225 Difference]: With dead ends: 50777 [2020-12-09 08:09:07,826 INFO L226 Difference]: Without dead ends: 29017 [2020-12-09 08:09:07,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29017 states. [2020-12-09 08:09:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29017 to 26125. [2020-12-09 08:09:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26125 states. [2020-12-09 08:09:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26125 states to 26125 states and 34492 transitions. [2020-12-09 08:09:08,918 INFO L78 Accepts]: Start accepts. Automaton has 26125 states and 34492 transitions. Word has length 87 [2020-12-09 08:09:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:08,918 INFO L481 AbstractCegarLoop]: Abstraction has 26125 states and 34492 transitions. [2020-12-09 08:09:08,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:09:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26125 states and 34492 transitions. [2020-12-09 08:09:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-09 08:09:08,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:08,924 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:09:08,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2020-12-09 08:09:08,924 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:08,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1236601420, now seen corresponding path program 1 times [2020-12-09 08:09:08,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:08,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718235973] [2020-12-09 08:09:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:08,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718235973] [2020-12-09 08:09:08,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:08,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:09:08,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443654985] [2020-12-09 08:09:08,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:09:08,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:08,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:09:08,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:09:08,955 INFO L87 Difference]: Start difference. First operand 26125 states and 34492 transitions. Second operand 5 states. [2020-12-09 08:09:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:10,107 INFO L93 Difference]: Finished difference Result 42303 states and 55610 transitions. [2020-12-09 08:09:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 08:09:10,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-12-09 08:09:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:10,127 INFO L225 Difference]: With dead ends: 42303 [2020-12-09 08:09:10,127 INFO L226 Difference]: Without dead ends: 25443 [2020-12-09 08:09:10,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 08:09:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25443 states. [2020-12-09 08:09:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25443 to 22505. [2020-12-09 08:09:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22505 states. [2020-12-09 08:09:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22505 states to 22505 states and 29914 transitions. [2020-12-09 08:09:11,119 INFO L78 Accepts]: Start accepts. Automaton has 22505 states and 29914 transitions. Word has length 87 [2020-12-09 08:09:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:11,120 INFO L481 AbstractCegarLoop]: Abstraction has 22505 states and 29914 transitions. [2020-12-09 08:09:11,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:09:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 22505 states and 29914 transitions. [2020-12-09 08:09:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-09 08:09:11,125 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:11,125 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 08:09:11,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-12-09 08:09:11,125 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1964431262, now seen corresponding path program 1 times [2020-12-09 08:09:11,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:11,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838198580] [2020-12-09 08:09:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:11,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838198580] [2020-12-09 08:09:11,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:11,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:09:11,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585597310] [2020-12-09 08:09:11,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:09:11,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:09:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:09:11,155 INFO L87 Difference]: Start difference. First operand 22505 states and 29914 transitions. Second operand 5 states. [2020-12-09 08:09:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:12,313 INFO L93 Difference]: Finished difference Result 37191 states and 49126 transitions. [2020-12-09 08:09:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 08:09:12,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-12-09 08:09:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:12,334 INFO L225 Difference]: With dead ends: 37191 [2020-12-09 08:09:12,334 INFO L226 Difference]: Without dead ends: 24795 [2020-12-09 08:09:12,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 08:09:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24795 states. [2020-12-09 08:09:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24795 to 21873. [2020-12-09 08:09:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21873 states. [2020-12-09 08:09:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21873 states to 21873 states and 29086 transitions. [2020-12-09 08:09:13,389 INFO L78 Accepts]: Start accepts. Automaton has 21873 states and 29086 transitions. Word has length 88 [2020-12-09 08:09:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:13,389 INFO L481 AbstractCegarLoop]: Abstraction has 21873 states and 29086 transitions. [2020-12-09 08:09:13,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:09:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21873 states and 29086 transitions. [2020-12-09 08:09:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-09 08:09:13,396 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:13,396 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 08:09:13,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-12-09 08:09:13,396 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:13,397 INFO L82 PathProgramCache]: Analyzing trace with hash -574154054, now seen corresponding path program 1 times [2020-12-09 08:09:13,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:13,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492403527] [2020-12-09 08:09:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:13,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492403527] [2020-12-09 08:09:13,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:13,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:09:13,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134388915] [2020-12-09 08:09:13,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:09:13,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:09:13,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:09:13,442 INFO L87 Difference]: Start difference. First operand 21873 states and 29086 transitions. Second operand 5 states. [2020-12-09 08:09:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:14,685 INFO L93 Difference]: Finished difference Result 46778 states and 62088 transitions. [2020-12-09 08:09:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 08:09:14,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2020-12-09 08:09:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:14,706 INFO L225 Difference]: With dead ends: 46778 [2020-12-09 08:09:14,706 INFO L226 Difference]: Without dead ends: 25062 [2020-12-09 08:09:14,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 08:09:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25062 states. [2020-12-09 08:09:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25062 to 21896. [2020-12-09 08:09:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2020-12-09 08:09:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 28707 transitions. [2020-12-09 08:09:15,796 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 28707 transitions. Word has length 89 [2020-12-09 08:09:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:15,797 INFO L481 AbstractCegarLoop]: Abstraction has 21896 states and 28707 transitions. [2020-12-09 08:09:15,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:09:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 28707 transitions. [2020-12-09 08:09:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-09 08:09:15,801 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:15,801 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:09:15,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2020-12-09 08:09:15,801 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash 647430414, now seen corresponding path program 1 times [2020-12-09 08:09:15,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:15,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606460765] [2020-12-09 08:09:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:15,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606460765] [2020-12-09 08:09:15,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:15,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:09:15,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144684233] [2020-12-09 08:09:15,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:09:15,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:15,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:09:15,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:15,827 INFO L87 Difference]: Start difference. First operand 21896 states and 28707 transitions. Second operand 3 states. [2020-12-09 08:09:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:16,526 INFO L93 Difference]: Finished difference Result 34569 states and 45548 transitions. [2020-12-09 08:09:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:09:16,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-12-09 08:09:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:16,538 INFO L225 Difference]: With dead ends: 34569 [2020-12-09 08:09:16,538 INFO L226 Difference]: Without dead ends: 13848 [2020-12-09 08:09:16,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:16,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13848 states. [2020-12-09 08:09:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13848 to 13712. [2020-12-09 08:09:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13712 states. [2020-12-09 08:09:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13712 states to 13712 states and 17598 transitions. [2020-12-09 08:09:17,233 INFO L78 Accepts]: Start accepts. Automaton has 13712 states and 17598 transitions. Word has length 89 [2020-12-09 08:09:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:17,233 INFO L481 AbstractCegarLoop]: Abstraction has 13712 states and 17598 transitions. [2020-12-09 08:09:17,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:09:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 13712 states and 17598 transitions. [2020-12-09 08:09:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-09 08:09:17,236 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:17,236 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:09:17,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2020-12-09 08:09:17,236 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 267269639, now seen corresponding path program 1 times [2020-12-09 08:09:17,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:17,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472858894] [2020-12-09 08:09:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:09:17,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472858894] [2020-12-09 08:09:17,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:17,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:09:17,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046952888] [2020-12-09 08:09:17,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:09:17,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:17,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:09:17,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:09:17,270 INFO L87 Difference]: Start difference. First operand 13712 states and 17598 transitions. Second operand 5 states. [2020-12-09 08:09:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:18,596 INFO L93 Difference]: Finished difference Result 36464 states and 46425 transitions. [2020-12-09 08:09:18,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 08:09:18,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2020-12-09 08:09:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:18,617 INFO L225 Difference]: With dead ends: 36464 [2020-12-09 08:09:18,617 INFO L226 Difference]: Without dead ends: 25755 [2020-12-09 08:09:18,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 08:09:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25755 states. [2020-12-09 08:09:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25755 to 15408. [2020-12-09 08:09:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15408 states. [2020-12-09 08:09:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15408 states to 15408 states and 19666 transitions. [2020-12-09 08:09:19,453 INFO L78 Accepts]: Start accepts. Automaton has 15408 states and 19666 transitions. Word has length 90 [2020-12-09 08:09:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:19,453 INFO L481 AbstractCegarLoop]: Abstraction has 15408 states and 19666 transitions. [2020-12-09 08:09:19,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:09:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 15408 states and 19666 transitions. [2020-12-09 08:09:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-09 08:09:19,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:19,457 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:09:19,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-12-09 08:09:19,457 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1186244262, now seen corresponding path program 1 times [2020-12-09 08:09:19,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:19,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850952209] [2020-12-09 08:09:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:19,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850952209] [2020-12-09 08:09:19,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:19,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:09:19,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516618828] [2020-12-09 08:09:19,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:09:19,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:19,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:09:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:19,480 INFO L87 Difference]: Start difference. First operand 15408 states and 19666 transitions. Second operand 3 states. [2020-12-09 08:09:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:20,233 INFO L93 Difference]: Finished difference Result 26734 states and 34185 transitions. [2020-12-09 08:09:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:09:20,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-09 08:09:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:20,244 INFO L225 Difference]: With dead ends: 26734 [2020-12-09 08:09:20,244 INFO L226 Difference]: Without dead ends: 14329 [2020-12-09 08:09:20,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14329 states. [2020-12-09 08:09:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14329 to 14259. [2020-12-09 08:09:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14259 states. [2020-12-09 08:09:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14259 states to 14259 states and 17691 transitions. [2020-12-09 08:09:21,010 INFO L78 Accepts]: Start accepts. Automaton has 14259 states and 17691 transitions. Word has length 90 [2020-12-09 08:09:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:21,010 INFO L481 AbstractCegarLoop]: Abstraction has 14259 states and 17691 transitions. [2020-12-09 08:09:21,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:09:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 14259 states and 17691 transitions. [2020-12-09 08:09:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-09 08:09:21,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:21,013 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 08:09:21,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-12-09 08:09:21,013 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash -746699636, now seen corresponding path program 1 times [2020-12-09 08:09:21,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:21,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22336219] [2020-12-09 08:09:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:09:21,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22336219] [2020-12-09 08:09:21,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:21,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:09:21,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725816748] [2020-12-09 08:09:21,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:09:21,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:21,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:09:21,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:09:21,047 INFO L87 Difference]: Start difference. First operand 14259 states and 17691 transitions. Second operand 5 states. [2020-12-09 08:09:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:22,656 INFO L93 Difference]: Finished difference Result 40805 states and 50038 transitions. [2020-12-09 08:09:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 08:09:22,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-12-09 08:09:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:22,677 INFO L225 Difference]: With dead ends: 40805 [2020-12-09 08:09:22,677 INFO L226 Difference]: Without dead ends: 27847 [2020-12-09 08:09:22,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 08:09:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27847 states. [2020-12-09 08:09:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27847 to 15209. [2020-12-09 08:09:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15209 states. [2020-12-09 08:09:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15209 states to 15209 states and 18799 transitions. [2020-12-09 08:09:23,603 INFO L78 Accepts]: Start accepts. Automaton has 15209 states and 18799 transitions. Word has length 91 [2020-12-09 08:09:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:23,604 INFO L481 AbstractCegarLoop]: Abstraction has 15209 states and 18799 transitions. [2020-12-09 08:09:23,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:09:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 15209 states and 18799 transitions. [2020-12-09 08:09:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-09 08:09:23,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:23,607 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 08:09:23,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2020-12-09 08:09:23,607 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash -107915157, now seen corresponding path program 1 times [2020-12-09 08:09:23,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:23,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420931281] [2020-12-09 08:09:23,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:23,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420931281] [2020-12-09 08:09:23,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:23,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:09:23,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046047782] [2020-12-09 08:09:23,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:09:23,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:09:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:23,633 INFO L87 Difference]: Start difference. First operand 15209 states and 18799 transitions. Second operand 3 states. [2020-12-09 08:09:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:24,544 INFO L93 Difference]: Finished difference Result 29127 states and 36085 transitions. [2020-12-09 08:09:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:09:24,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-12-09 08:09:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:24,556 INFO L225 Difference]: With dead ends: 29127 [2020-12-09 08:09:24,556 INFO L226 Difference]: Without dead ends: 15215 [2020-12-09 08:09:24,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15215 states. [2020-12-09 08:09:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15215 to 15123. [2020-12-09 08:09:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15123 states. [2020-12-09 08:09:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15123 states to 15123 states and 18027 transitions. [2020-12-09 08:09:25,482 INFO L78 Accepts]: Start accepts. Automaton has 15123 states and 18027 transitions. Word has length 91 [2020-12-09 08:09:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:25,482 INFO L481 AbstractCegarLoop]: Abstraction has 15123 states and 18027 transitions. [2020-12-09 08:09:25,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:09:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15123 states and 18027 transitions. [2020-12-09 08:09:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-09 08:09:25,485 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:25,485 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 08:09:25,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2020-12-09 08:09:25,486 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash 211346170, now seen corresponding path program 1 times [2020-12-09 08:09:25,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:25,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845270112] [2020-12-09 08:09:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:25,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845270112] [2020-12-09 08:09:25,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591734778] [2020-12-09 08:09:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:09:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:25,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 08:09:25,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:09:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:09:25,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:09:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:09:25,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:09:25,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [9] total 11 [2020-12-09 08:09:25,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153786827] [2020-12-09 08:09:25,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:09:25,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:25,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:09:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 08:09:25,797 INFO L87 Difference]: Start difference. First operand 15123 states and 18027 transitions. Second operand 4 states. [2020-12-09 08:09:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:26,703 INFO L93 Difference]: Finished difference Result 24824 states and 29766 transitions. [2020-12-09 08:09:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:09:26,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-09 08:09:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:26,716 INFO L225 Difference]: With dead ends: 24824 [2020-12-09 08:09:26,716 INFO L226 Difference]: Without dead ends: 14198 [2020-12-09 08:09:26,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 08:09:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14198 states. [2020-12-09 08:09:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14198 to 13930. [2020-12-09 08:09:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13930 states. [2020-12-09 08:09:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13930 states to 13930 states and 16469 transitions. [2020-12-09 08:09:27,598 INFO L78 Accepts]: Start accepts. Automaton has 13930 states and 16469 transitions. Word has length 92 [2020-12-09 08:09:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:27,598 INFO L481 AbstractCegarLoop]: Abstraction has 13930 states and 16469 transitions. [2020-12-09 08:09:27,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:09:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13930 states and 16469 transitions. [2020-12-09 08:09:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-09 08:09:27,601 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:27,601 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 08:09:27,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:09:27,802 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 455132168, now seen corresponding path program 1 times [2020-12-09 08:09:27,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:27,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222367410] [2020-12-09 08:09:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:27,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222367410] [2020-12-09 08:09:27,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535295257] [2020-12-09 08:09:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:09:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:27,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 08:09:27,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:09:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:09:28,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:09:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:09:28,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:09:28,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [9] total 11 [2020-12-09 08:09:28,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133305446] [2020-12-09 08:09:28,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:09:28,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:28,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:09:28,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 08:09:28,118 INFO L87 Difference]: Start difference. First operand 13930 states and 16469 transitions. Second operand 4 states. [2020-12-09 08:09:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:28,966 INFO L93 Difference]: Finished difference Result 17287 states and 20473 transitions. [2020-12-09 08:09:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:09:28,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-09 08:09:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:28,976 INFO L225 Difference]: With dead ends: 17287 [2020-12-09 08:09:28,976 INFO L226 Difference]: Without dead ends: 13964 [2020-12-09 08:09:28,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 08:09:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13964 states. [2020-12-09 08:09:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13964 to 13930. [2020-12-09 08:09:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13930 states. [2020-12-09 08:09:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13930 states to 13930 states and 16445 transitions. [2020-12-09 08:09:29,864 INFO L78 Accepts]: Start accepts. Automaton has 13930 states and 16445 transitions. Word has length 92 [2020-12-09 08:09:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:29,864 INFO L481 AbstractCegarLoop]: Abstraction has 13930 states and 16445 transitions. [2020-12-09 08:09:29,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:09:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13930 states and 16445 transitions. [2020-12-09 08:09:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-09 08:09:29,868 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:29,869 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] [2020-12-09 08:09:30,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2020-12-09 08:09:30,070 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 411482205, now seen corresponding path program 1 times [2020-12-09 08:09:30,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:30,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841288690] [2020-12-09 08:09:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:09:30,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841288690] [2020-12-09 08:09:30,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009707721] [2020-12-09 08:09:30,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:09:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:30,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 08:09:30,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:09:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:09:30,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:09:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:09:30,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:09:30,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [3] total 5 [2020-12-09 08:09:30,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755286815] [2020-12-09 08:09:30,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:09:30,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:30,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:09:30,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 08:09:30,331 INFO L87 Difference]: Start difference. First operand 13930 states and 16445 transitions. Second operand 4 states. [2020-12-09 08:09:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:31,259 INFO L93 Difference]: Finished difference Result 26047 states and 30768 transitions. [2020-12-09 08:09:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:09:31,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2020-12-09 08:09:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:31,268 INFO L225 Difference]: With dead ends: 26047 [2020-12-09 08:09:31,268 INFO L226 Difference]: Without dead ends: 13387 [2020-12-09 08:09:31,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 08:09:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13387 states. [2020-12-09 08:09:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13387 to 13027. [2020-12-09 08:09:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13027 states. [2020-12-09 08:09:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13027 states to 13027 states and 15208 transitions. [2020-12-09 08:09:32,107 INFO L78 Accepts]: Start accepts. Automaton has 13027 states and 15208 transitions. Word has length 110 [2020-12-09 08:09:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:32,107 INFO L481 AbstractCegarLoop]: Abstraction has 13027 states and 15208 transitions. [2020-12-09 08:09:32,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:09:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 13027 states and 15208 transitions. [2020-12-09 08:09:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-09 08:09:32,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:32,111 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, 1, 1] [2020-12-09 08:09:32,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:09:32,312 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash -886448971, now seen corresponding path program 1 times [2020-12-09 08:09:32,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:32,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594751325] [2020-12-09 08:09:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:32,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594751325] [2020-12-09 08:09:32,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:32,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:09:32,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169270910] [2020-12-09 08:09:32,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:09:32,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:32,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:09:32,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:09:32,381 INFO L87 Difference]: Start difference. First operand 13027 states and 15208 transitions. Second operand 4 states. [2020-12-09 08:09:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:33,273 INFO L93 Difference]: Finished difference Result 24496 states and 28383 transitions. [2020-12-09 08:09:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:09:33,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2020-12-09 08:09:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:33,283 INFO L225 Difference]: With dead ends: 24496 [2020-12-09 08:09:33,283 INFO L226 Difference]: Without dead ends: 12739 [2020-12-09 08:09:33,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:09:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2020-12-09 08:09:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 10469. [2020-12-09 08:09:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10469 states. [2020-12-09 08:09:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10469 states to 10469 states and 11844 transitions. [2020-12-09 08:09:33,964 INFO L78 Accepts]: Start accepts. Automaton has 10469 states and 11844 transitions. Word has length 113 [2020-12-09 08:09:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:33,964 INFO L481 AbstractCegarLoop]: Abstraction has 10469 states and 11844 transitions. [2020-12-09 08:09:33,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:09:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 10469 states and 11844 transitions. [2020-12-09 08:09:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-09 08:09:33,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:33,967 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, 1, 1, 1] [2020-12-09 08:09:33,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-12-09 08:09:33,967 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:33,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1507247439, now seen corresponding path program 1 times [2020-12-09 08:09:33,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:33,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039516828] [2020-12-09 08:09:33,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:09:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:09:33,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039516828] [2020-12-09 08:09:33,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:09:33,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:09:33,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453386785] [2020-12-09 08:09:33,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:09:33,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:09:33,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:09:33,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:33,991 INFO L87 Difference]: Start difference. First operand 10469 states and 11844 transitions. Second operand 3 states. [2020-12-09 08:09:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:09:34,486 INFO L93 Difference]: Finished difference Result 16649 states and 18966 transitions. [2020-12-09 08:09:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:09:34,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-09 08:09:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:09:34,491 INFO L225 Difference]: With dead ends: 16649 [2020-12-09 08:09:34,491 INFO L226 Difference]: Without dead ends: 6609 [2020-12-09 08:09:34,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:09:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6609 states. [2020-12-09 08:09:34,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6609 to 6373. [2020-12-09 08:09:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6373 states. [2020-12-09 08:09:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6373 states to 6373 states and 7284 transitions. [2020-12-09 08:09:34,965 INFO L78 Accepts]: Start accepts. Automaton has 6373 states and 7284 transitions. Word has length 115 [2020-12-09 08:09:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:09:34,966 INFO L481 AbstractCegarLoop]: Abstraction has 6373 states and 7284 transitions. [2020-12-09 08:09:34,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:09:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 6373 states and 7284 transitions. [2020-12-09 08:09:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-09 08:09:34,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:09:34,968 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-12-09 08:09:34,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-12-09 08:09:34,968 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:09:34,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:09:34,968 INFO L82 PathProgramCache]: Analyzing trace with hash -630324461, now seen corresponding path program 1 times [2020-12-09 08:09:34,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:09:34,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984519937] [2020-12-09 08:09:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:09:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 08:09:34,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 08:09:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 08:09:35,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 08:09:35,062 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 08:09:35,062 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 08:09:35,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2020-12-09 08:09:35,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:09:35 BoogieIcfgContainer [2020-12-09 08:09:35,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 08:09:35,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 08:09:35,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 08:09:35,192 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 08:09:35,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:08:27" (3/4) ... [2020-12-09 08:09:35,193 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 08:09:35,291 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_32d54e00-b1ce-48b7-8be1-75bb37f2682a/bin/utaipan/witness.graphml [2020-12-09 08:09:35,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 08:09:35,292 INFO L168 Benchmark]: Toolchain (without parser) took 69949.61 ms. Allocated memory was 100.7 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 78.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 696.3 MB. Max. memory is 16.1 GB. [2020-12-09 08:09:35,292 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 69.2 MB. Free memory is still 40.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 08:09:35,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.98 ms. Allocated memory is still 100.7 MB. Free memory was 78.5 MB in the beginning and 63.1 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 08:09:35,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.42 ms. Allocated memory is still 100.7 MB. Free memory was 63.1 MB in the beginning and 58.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 08:09:35,293 INFO L168 Benchmark]: Boogie Preprocessor took 40.82 ms. Allocated memory is still 100.7 MB. Free memory was 58.9 MB in the beginning and 55.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 08:09:35,293 INFO L168 Benchmark]: RCFGBuilder took 1577.29 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 55.3 MB in the beginning and 73.4 MB in the end (delta: -18.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 16.1 GB. [2020-12-09 08:09:35,293 INFO L168 Benchmark]: TraceAbstraction took 67940.16 ms. Allocated memory was 121.6 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 73.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 640.8 MB. Max. memory is 16.1 GB. [2020-12-09 08:09:35,294 INFO L168 Benchmark]: Witness Printer took 100.06 ms. Allocated memory is still 2.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-12-09 08:09:35,295 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.18 ms. Allocated memory is still 69.2 MB. Free memory is still 40.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 233.98 ms. Allocated memory is still 100.7 MB. Free memory was 78.5 MB in the beginning and 63.1 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.42 ms. Allocated memory is still 100.7 MB. Free memory was 63.1 MB in the beginning and 58.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.82 ms. Allocated memory is still 100.7 MB. Free memory was 58.9 MB in the beginning and 55.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1577.29 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 55.3 MB in the beginning and 73.4 MB in the end (delta: -18.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 67940.16 ms. Allocated memory was 121.6 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 73.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 640.8 MB. Max. memory is 16.1 GB. * Witness Printer took 100.06 ms. Allocated memory is still 2.3 GB. Free memory was 1.6 GB in the beginning and 1.6 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: 13]: a call to reach_error is reachable a call to reach_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] [L13] 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: 67.7s, OverallIterations: 34, TraceHistogramMax: 4, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10459 SDtfs, 13742 SDslu, 12894 SDs, 0 SdLazy, 1581 SolverSat, 542 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 819 SyntacticMatches, 9 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2180 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26125occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 94851 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2899 NumberOfCodeBlocks, 2899 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3081 ConstructedInterpolants, 0 QuantifiedInterpolants, 543548 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1678 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 560/571 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...