./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.04.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG --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 1ec3ea32382f407cf861c3067ab994313a1de2b62bed831e309aa68653121144 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1-dev-b2eff8b [2021-10-29 05:27:51,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:27:51,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:27:51,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:27:51,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:27:51,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:27:51,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:27:51,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:27:51,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:27:51,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:27:51,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:27:51,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:27:51,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:27:51,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:27:51,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:27:51,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:27:51,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:27:51,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:27:51,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:27:51,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:27:51,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:27:51,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:27:51,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:27:51,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:27:51,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:27:51,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:27:51,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:27:51,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:27:51,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:27:51,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:27:51,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:27:51,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:27:51,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:27:51,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:27:51,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:27:51,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:27:51,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:27:51,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:27:51,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:27:51,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:27:51,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:27:51,742 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:27:51,771 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:27:51,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:27:51,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:27:51,773 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:27:51,774 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:27:51,774 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:27:51,775 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:27:51,775 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:27:51,775 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:27:51,776 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:27:51,776 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:27:51,776 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:27:51,777 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:27:51,777 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:27:51,778 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:27:51,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:27:51,779 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:27:51,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:27:51,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:27:51,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:27:51,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:27:51,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:27:51,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:27:51,782 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:27:51,782 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:27:51,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:27:51,783 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:27:51,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:27:51,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:27:51,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:27:51,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:27:51,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:27:51,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:27:51,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:27:51,786 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:27:51,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:27:51,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:27:51,787 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:27:51,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:27:51,788 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_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/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_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG 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 -> 1ec3ea32382f407cf861c3067ab994313a1de2b62bed831e309aa68653121144 [2021-10-29 05:27:52,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:27:52,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:27:52,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:27:52,105 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:27:52,106 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:27:52,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/systemc/transmitter.04.cil.c [2021-10-29 05:27:52,179 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/data/f08b89788/a82d68041d504596ba88caeb1058b099/FLAG09c3349fb [2021-10-29 05:27:52,709 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:27:52,710 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/sv-benchmarks/c/systemc/transmitter.04.cil.c [2021-10-29 05:27:52,732 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/data/f08b89788/a82d68041d504596ba88caeb1058b099/FLAG09c3349fb [2021-10-29 05:27:53,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/data/f08b89788/a82d68041d504596ba88caeb1058b099 [2021-10-29 05:27:53,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:27:53,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:27:53,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:27:53,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:27:53,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:27:53,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231e6be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53, skipping insertion in model container [2021-10-29 05:27:53,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:27:53,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:27:53,240 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/sv-benchmarks/c/systemc/transmitter.04.cil.c[401,414] [2021-10-29 05:27:53,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:27:53,320 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:27:53,333 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/sv-benchmarks/c/systemc/transmitter.04.cil.c[401,414] [2021-10-29 05:27:53,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:27:53,390 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:27:53,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53 WrapperNode [2021-10-29 05:27:53,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:27:53,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:27:53,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:27:53,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:27:53,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:27:53,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:27:53,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:27:53,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:27:53,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:27:53,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:27:53,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:27:53,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:27:53,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (1/1) ... [2021-10-29 05:27:53,609 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:27:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:53,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:27:53,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:27:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:27:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:27:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:27:53,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:27:55,943 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:27:55,944 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2021-10-29 05:27:55,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:27:55 BoogieIcfgContainer [2021-10-29 05:27:55,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:27:55,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:27:55,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:27:55,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:27:55,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:27:53" (1/3) ... [2021-10-29 05:27:55,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1684a4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:27:55, skipping insertion in model container [2021-10-29 05:27:55,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:27:53" (2/3) ... [2021-10-29 05:27:55,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1684a4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:27:55, skipping insertion in model container [2021-10-29 05:27:55,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:27:55" (3/3) ... [2021-10-29 05:27:55,959 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2021-10-29 05:27:55,968 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:27:55,969 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 05:27:56,034 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:27:56,042 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:27:56,042 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 05:27:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 177 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:27:56,072 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:56,072 INFO L513 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] [2021-10-29 05:27:56,073 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1562977161, now seen corresponding path program 1 times [2021-10-29 05:27:56,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:56,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115459756] [2021-10-29 05:27:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:56,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:56,369 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:56,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115459756] [2021-10-29 05:27:56,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115459756] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:56,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:56,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:27:56,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562700469] [2021-10-29 05:27:56,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:27:56,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:27:56,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:27:56,409 INFO L87 Difference]: Start difference. First operand has 178 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 177 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:56,560 INFO L93 Difference]: Finished difference Result 481 states and 740 transitions. [2021-10-29 05:27:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:27:56,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-29 05:27:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:56,576 INFO L225 Difference]: With dead ends: 481 [2021-10-29 05:27:56,578 INFO L226 Difference]: Without dead ends: 305 [2021-10-29 05:27:56,581 INFO L786 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 [2021-10-29 05:27:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-10-29 05:27:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2021-10-29 05:27:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.5016611295681064) internal successors, (452), 301 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 452 transitions. [2021-10-29 05:27:56,640 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 452 transitions. Word has length 28 [2021-10-29 05:27:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:56,641 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 452 transitions. [2021-10-29 05:27:56,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 452 transitions. [2021-10-29 05:27:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:27:56,643 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:56,643 INFO L513 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] [2021-10-29 05:27:56,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:27:56,644 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1141595158, now seen corresponding path program 1 times [2021-10-29 05:27:56,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:56,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622445775] [2021-10-29 05:27:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:56,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:56,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:56,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622445775] [2021-10-29 05:27:56,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622445775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:56,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:56,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:27:56,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745602447] [2021-10-29 05:27:56,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:27:56,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:27:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:27:56,731 INFO L87 Difference]: Start difference. First operand 302 states and 452 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:56,922 INFO L93 Difference]: Finished difference Result 1071 states and 1593 transitions. [2021-10-29 05:27:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:27:56,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-29 05:27:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:56,932 INFO L225 Difference]: With dead ends: 1071 [2021-10-29 05:27:56,932 INFO L226 Difference]: Without dead ends: 771 [2021-10-29 05:27:56,938 INFO L786 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 [2021-10-29 05:27:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2021-10-29 05:27:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 712. [2021-10-29 05:27:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 1.4571026722925458) internal successors, (1036), 711 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1036 transitions. [2021-10-29 05:27:57,014 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1036 transitions. Word has length 28 [2021-10-29 05:27:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:57,015 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 1036 transitions. [2021-10-29 05:27:57,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1036 transitions. [2021-10-29 05:27:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:27:57,024 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:57,024 INFO L513 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] [2021-10-29 05:27:57,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:27:57,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2013020427, now seen corresponding path program 1 times [2021-10-29 05:27:57,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:57,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939945384] [2021-10-29 05:27:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:57,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:57,172 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:57,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939945384] [2021-10-29 05:27:57,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939945384] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:57,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:57,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:27:57,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384230928] [2021-10-29 05:27:57,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:27:57,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:57,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:27:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:27:57,185 INFO L87 Difference]: Start difference. First operand 712 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:57,357 INFO L93 Difference]: Finished difference Result 2003 states and 2930 transitions. [2021-10-29 05:27:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:27:57,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-29 05:27:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:57,367 INFO L225 Difference]: With dead ends: 2003 [2021-10-29 05:27:57,367 INFO L226 Difference]: Without dead ends: 1309 [2021-10-29 05:27:57,369 INFO L786 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 [2021-10-29 05:27:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-10-29 05:27:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1025. [2021-10-29 05:27:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 1.4609375) internal successors, (1496), 1024 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1496 transitions. [2021-10-29 05:27:57,426 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1496 transitions. Word has length 28 [2021-10-29 05:27:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:57,427 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1496 transitions. [2021-10-29 05:27:57,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1496 transitions. [2021-10-29 05:27:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:27:57,431 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:57,431 INFO L513 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] [2021-10-29 05:27:57,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:27:57,432 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:57,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1481947965, now seen corresponding path program 1 times [2021-10-29 05:27:57,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:57,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701376565] [2021-10-29 05:27:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:57,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:57,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:57,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701376565] [2021-10-29 05:27:57,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701376565] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:57,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:57,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:27:57,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053614948] [2021-10-29 05:27:57,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:27:57,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:57,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:27:57,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:27:57,546 INFO L87 Difference]: Start difference. First operand 1025 states and 1496 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:57,676 INFO L93 Difference]: Finished difference Result 2991 states and 4349 transitions. [2021-10-29 05:27:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:27:57,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-29 05:27:57,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:57,689 INFO L225 Difference]: With dead ends: 2991 [2021-10-29 05:27:57,689 INFO L226 Difference]: Without dead ends: 1981 [2021-10-29 05:27:57,692 INFO L786 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 [2021-10-29 05:27:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2021-10-29 05:27:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1972. [2021-10-29 05:27:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.4271943176052766) internal successors, (2813), 1971 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2813 transitions. [2021-10-29 05:27:57,789 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2813 transitions. Word has length 29 [2021-10-29 05:27:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:57,790 INFO L470 AbstractCegarLoop]: Abstraction has 1972 states and 2813 transitions. [2021-10-29 05:27:57,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2813 transitions. [2021-10-29 05:27:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 05:27:57,795 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:57,795 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 05:27:57,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:27:57,796 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:57,796 INFO L85 PathProgramCache]: Analyzing trace with hash 65734536, now seen corresponding path program 1 times [2021-10-29 05:27:57,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:57,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911633908] [2021-10-29 05:27:57,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:57,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:57,887 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:57,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911633908] [2021-10-29 05:27:57,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911633908] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:57,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:57,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:27:57,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268783265] [2021-10-29 05:27:57,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:27:57,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:27:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:27:57,890 INFO L87 Difference]: Start difference. First operand 1972 states and 2813 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:58,026 INFO L93 Difference]: Finished difference Result 3744 states and 5418 transitions. [2021-10-29 05:27:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:27:58,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-29 05:27:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:58,043 INFO L225 Difference]: With dead ends: 3744 [2021-10-29 05:27:58,044 INFO L226 Difference]: Without dead ends: 2737 [2021-10-29 05:27:58,046 INFO L786 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 [2021-10-29 05:27:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2021-10-29 05:27:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2143. [2021-10-29 05:27:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2143 states, 2142 states have (on average 1.4491129785247432) internal successors, (3104), 2142 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 3104 transitions. [2021-10-29 05:27:58,156 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 3104 transitions. Word has length 40 [2021-10-29 05:27:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:58,156 INFO L470 AbstractCegarLoop]: Abstraction has 2143 states and 3104 transitions. [2021-10-29 05:27:58,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 3104 transitions. [2021-10-29 05:27:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-29 05:27:58,162 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:58,163 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 05:27:58,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:27:58,163 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1652373574, now seen corresponding path program 1 times [2021-10-29 05:27:58,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:58,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768756646] [2021-10-29 05:27:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:58,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:58,249 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:58,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768756646] [2021-10-29 05:27:58,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768756646] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:58,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:58,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:27:58,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943617822] [2021-10-29 05:27:58,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:27:58,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:58,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:27:58,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:27:58,255 INFO L87 Difference]: Start difference. First operand 2143 states and 3104 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:58,441 INFO L93 Difference]: Finished difference Result 4965 states and 7303 transitions. [2021-10-29 05:27:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:27:58,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-29 05:27:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:58,461 INFO L225 Difference]: With dead ends: 4965 [2021-10-29 05:27:58,461 INFO L226 Difference]: Without dead ends: 2839 [2021-10-29 05:27:58,467 INFO L786 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 [2021-10-29 05:27:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-10-29 05:27:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2629. [2021-10-29 05:27:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2628 states have (on average 1.4893455098934552) internal successors, (3914), 2628 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3914 transitions. [2021-10-29 05:27:58,620 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3914 transitions. Word has length 59 [2021-10-29 05:27:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:58,622 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 3914 transitions. [2021-10-29 05:27:58,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3914 transitions. [2021-10-29 05:27:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-29 05:27:58,629 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:58,629 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 05:27:58,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:27:58,630 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1831223825, now seen corresponding path program 1 times [2021-10-29 05:27:58,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:58,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444665146] [2021-10-29 05:27:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:58,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:58,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:58,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444665146] [2021-10-29 05:27:58,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444665146] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:58,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:58,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:27:58,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087862078] [2021-10-29 05:27:58,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:27:58,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:58,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:27:58,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:27:58,730 INFO L87 Difference]: Start difference. First operand 2629 states and 3914 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:58,983 INFO L93 Difference]: Finished difference Result 6636 states and 9997 transitions. [2021-10-29 05:27:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:27:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-29 05:27:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:59,008 INFO L225 Difference]: With dead ends: 6636 [2021-10-29 05:27:59,009 INFO L226 Difference]: Without dead ends: 4024 [2021-10-29 05:27:59,014 INFO L786 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 [2021-10-29 05:27:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2021-10-29 05:27:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3466. [2021-10-29 05:27:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 3465 states have (on average 1.5217893217893217) internal successors, (5273), 3465 states have internal predecessors, (5273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 5273 transitions. [2021-10-29 05:27:59,259 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 5273 transitions. Word has length 59 [2021-10-29 05:27:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:59,260 INFO L470 AbstractCegarLoop]: Abstraction has 3466 states and 5273 transitions. [2021-10-29 05:27:59,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 5273 transitions. [2021-10-29 05:27:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-29 05:27:59,269 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:59,269 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 05:27:59,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:27:59,269 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash 200151229, now seen corresponding path program 1 times [2021-10-29 05:27:59,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:59,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380883721] [2021-10-29 05:27:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:59,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:59,319 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:59,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380883721] [2021-10-29 05:27:59,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380883721] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:59,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:59,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:27:59,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018899440] [2021-10-29 05:27:59,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:27:59,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:27:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:27:59,322 INFO L87 Difference]: Start difference. First operand 3466 states and 5273 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:59,536 INFO L93 Difference]: Finished difference Result 5526 states and 8484 transitions. [2021-10-29 05:27:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:27:59,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-29 05:27:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:59,558 INFO L225 Difference]: With dead ends: 5526 [2021-10-29 05:27:59,559 INFO L226 Difference]: Without dead ends: 3466 [2021-10-29 05:27:59,563 INFO L786 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 [2021-10-29 05:27:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2021-10-29 05:27:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3396. [2021-10-29 05:27:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3395 states have (on average 1.4998527245949926) internal successors, (5092), 3395 states have internal predecessors, (5092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5092 transitions. [2021-10-29 05:27:59,803 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5092 transitions. Word has length 60 [2021-10-29 05:27:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:59,804 INFO L470 AbstractCegarLoop]: Abstraction has 3396 states and 5092 transitions. [2021-10-29 05:27:59,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:27:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5092 transitions. [2021-10-29 05:27:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-29 05:27:59,811 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:59,811 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 05:27:59,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:27:59,812 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1479475964, now seen corresponding path program 1 times [2021-10-29 05:27:59,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:59,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249852740] [2021-10-29 05:27:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:59,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:27:59,904 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:59,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249852740] [2021-10-29 05:27:59,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249852740] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:59,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:59,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:27:59,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159003041] [2021-10-29 05:27:59,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:27:59,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:27:59,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:27:59,907 INFO L87 Difference]: Start difference. First operand 3396 states and 5092 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:00,090 INFO L93 Difference]: Finished difference Result 4795 states and 7183 transitions. [2021-10-29 05:28:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:28:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-29 05:28:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:00,112 INFO L225 Difference]: With dead ends: 4795 [2021-10-29 05:28:00,112 INFO L226 Difference]: Without dead ends: 3399 [2021-10-29 05:28:00,116 INFO L786 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 [2021-10-29 05:28:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2021-10-29 05:28:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3396. [2021-10-29 05:28:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3395 states have (on average 1.4892488954344625) internal successors, (5056), 3395 states have internal predecessors, (5056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5056 transitions. [2021-10-29 05:28:00,364 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5056 transitions. Word has length 60 [2021-10-29 05:28:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:00,365 INFO L470 AbstractCegarLoop]: Abstraction has 3396 states and 5056 transitions. [2021-10-29 05:28:00,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5056 transitions. [2021-10-29 05:28:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-29 05:28:00,372 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:00,373 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 05:28:00,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:28:00,373 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash -842990924, now seen corresponding path program 1 times [2021-10-29 05:28:00,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:00,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137179367] [2021-10-29 05:28:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:00,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:28:00,444 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:00,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137179367] [2021-10-29 05:28:00,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137179367] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:00,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:00,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:28:00,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981384511] [2021-10-29 05:28:00,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:28:00,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:28:00,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:28:00,446 INFO L87 Difference]: Start difference. First operand 3396 states and 5056 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:00,732 INFO L93 Difference]: Finished difference Result 6255 states and 9209 transitions. [2021-10-29 05:28:00,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:28:00,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-29 05:28:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:00,762 INFO L225 Difference]: With dead ends: 6255 [2021-10-29 05:28:00,762 INFO L226 Difference]: Without dead ends: 4859 [2021-10-29 05:28:00,765 INFO L786 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 [2021-10-29 05:28:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2021-10-29 05:28:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 3824. [2021-10-29 05:28:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3823 states have (on average 1.4546167930944285) internal successors, (5561), 3823 states have internal predecessors, (5561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5561 transitions. [2021-10-29 05:28:01,002 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5561 transitions. Word has length 61 [2021-10-29 05:28:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:01,003 INFO L470 AbstractCegarLoop]: Abstraction has 3824 states and 5561 transitions. [2021-10-29 05:28:01,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5561 transitions. [2021-10-29 05:28:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-29 05:28:01,010 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:01,011 INFO L513 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] [2021-10-29 05:28:01,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:28:01,011 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:01,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 915840223, now seen corresponding path program 1 times [2021-10-29 05:28:01,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:01,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154101972] [2021-10-29 05:28:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:01,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:28:01,051 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:01,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154101972] [2021-10-29 05:28:01,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154101972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:01,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:01,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:28:01,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775224540] [2021-10-29 05:28:01,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:01,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:01,054 INFO L87 Difference]: Start difference. First operand 3824 states and 5561 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:01,325 INFO L93 Difference]: Finished difference Result 7970 states and 11703 transitions. [2021-10-29 05:28:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:01,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-29 05:28:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:01,340 INFO L225 Difference]: With dead ends: 7970 [2021-10-29 05:28:01,341 INFO L226 Difference]: Without dead ends: 4905 [2021-10-29 05:28:01,347 INFO L786 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 [2021-10-29 05:28:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2021-10-29 05:28:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4352. [2021-10-29 05:28:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4352 states, 4351 states have (on average 1.4683980694093313) internal successors, (6389), 4351 states have internal predecessors, (6389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 6389 transitions. [2021-10-29 05:28:01,620 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 6389 transitions. Word has length 62 [2021-10-29 05:28:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:01,621 INFO L470 AbstractCegarLoop]: Abstraction has 4352 states and 6389 transitions. [2021-10-29 05:28:01,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 6389 transitions. [2021-10-29 05:28:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-29 05:28:01,635 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:01,635 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:28:01,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:28:01,636 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1649650490, now seen corresponding path program 1 times [2021-10-29 05:28:01,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:01,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390445565] [2021-10-29 05:28:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:01,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-29 05:28:01,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:01,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390445565] [2021-10-29 05:28:01,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390445565] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:01,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:01,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:28:01,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555413428] [2021-10-29 05:28:01,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:01,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:01,727 INFO L87 Difference]: Start difference. First operand 4352 states and 6389 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:01,935 INFO L93 Difference]: Finished difference Result 8551 states and 12483 transitions. [2021-10-29 05:28:01,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:01,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-10-29 05:28:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:01,948 INFO L225 Difference]: With dead ends: 8551 [2021-10-29 05:28:01,948 INFO L226 Difference]: Without dead ends: 4958 [2021-10-29 05:28:01,955 INFO L786 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 [2021-10-29 05:28:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2021-10-29 05:28:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4352. [2021-10-29 05:28:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4352 states, 4351 states have (on average 1.456676626062974) internal successors, (6338), 4351 states have internal predecessors, (6338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 6338 transitions. [2021-10-29 05:28:02,226 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 6338 transitions. Word has length 83 [2021-10-29 05:28:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:02,226 INFO L470 AbstractCegarLoop]: Abstraction has 4352 states and 6338 transitions. [2021-10-29 05:28:02,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 6338 transitions. [2021-10-29 05:28:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-29 05:28:02,235 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:02,236 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:28:02,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 05:28:02,236 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1671827847, now seen corresponding path program 1 times [2021-10-29 05:28:02,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:02,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951965792] [2021-10-29 05:28:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:02,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:28:02,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:02,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951965792] [2021-10-29 05:28:02,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951965792] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:02,281 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:02,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:28:02,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94369974] [2021-10-29 05:28:02,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:02,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:02,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:02,284 INFO L87 Difference]: Start difference. First operand 4352 states and 6338 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:02,621 INFO L93 Difference]: Finished difference Result 11379 states and 16687 transitions. [2021-10-29 05:28:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-10-29 05:28:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:02,642 INFO L225 Difference]: With dead ends: 11379 [2021-10-29 05:28:02,642 INFO L226 Difference]: Without dead ends: 7786 [2021-10-29 05:28:02,649 INFO L786 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 [2021-10-29 05:28:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2021-10-29 05:28:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 7461. [2021-10-29 05:28:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7461 states, 7460 states have (on average 1.4513404825737266) internal successors, (10827), 7460 states have internal predecessors, (10827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 10827 transitions. [2021-10-29 05:28:03,099 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 10827 transitions. Word has length 83 [2021-10-29 05:28:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:03,099 INFO L470 AbstractCegarLoop]: Abstraction has 7461 states and 10827 transitions. [2021-10-29 05:28:03,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 10827 transitions. [2021-10-29 05:28:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-29 05:28:03,115 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:03,116 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:28:03,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 05:28:03,116 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:03,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1936393939, now seen corresponding path program 1 times [2021-10-29 05:28:03,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:03,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141905102] [2021-10-29 05:28:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:03,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-29 05:28:03,160 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:03,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141905102] [2021-10-29 05:28:03,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141905102] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:03,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:03,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:28:03,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072176651] [2021-10-29 05:28:03,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:03,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:03,164 INFO L87 Difference]: Start difference. First operand 7461 states and 10827 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:03,753 INFO L93 Difference]: Finished difference Result 21340 states and 30986 transitions. [2021-10-29 05:28:03,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:03,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-10-29 05:28:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:03,794 INFO L225 Difference]: With dead ends: 21340 [2021-10-29 05:28:03,795 INFO L226 Difference]: Without dead ends: 13887 [2021-10-29 05:28:03,806 INFO L786 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 [2021-10-29 05:28:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13887 states. [2021-10-29 05:28:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13887 to 13763. [2021-10-29 05:28:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13763 states, 13762 states have (on average 1.4380177299811074) internal successors, (19790), 13762 states have internal predecessors, (19790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13763 states to 13763 states and 19790 transitions. [2021-10-29 05:28:04,494 INFO L78 Accepts]: Start accepts. Automaton has 13763 states and 19790 transitions. Word has length 83 [2021-10-29 05:28:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:04,494 INFO L470 AbstractCegarLoop]: Abstraction has 13763 states and 19790 transitions. [2021-10-29 05:28:04,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 13763 states and 19790 transitions. [2021-10-29 05:28:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-29 05:28:04,532 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:04,532 INFO L513 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] [2021-10-29 05:28:04,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 05:28:04,533 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:04,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1132087261, now seen corresponding path program 1 times [2021-10-29 05:28:04,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:04,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514775073] [2021-10-29 05:28:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:04,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:28:04,570 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:04,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514775073] [2021-10-29 05:28:04,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514775073] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:04,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:04,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:28:04,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054195649] [2021-10-29 05:28:04,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:04,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:04,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:04,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:04,572 INFO L87 Difference]: Start difference. First operand 13763 states and 19790 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:05,152 INFO L93 Difference]: Finished difference Result 25799 states and 37560 transitions. [2021-10-29 05:28:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-10-29 05:28:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:05,199 INFO L225 Difference]: With dead ends: 25799 [2021-10-29 05:28:05,199 INFO L226 Difference]: Without dead ends: 16509 [2021-10-29 05:28:05,213 INFO L786 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 [2021-10-29 05:28:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16509 states. [2021-10-29 05:28:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16509 to 15951. [2021-10-29 05:28:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15951 states, 15950 states have (on average 1.453667711598746) internal successors, (23186), 15950 states have internal predecessors, (23186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15951 states to 15951 states and 23186 transitions. [2021-10-29 05:28:05,939 INFO L78 Accepts]: Start accepts. Automaton has 15951 states and 23186 transitions. Word has length 83 [2021-10-29 05:28:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:05,940 INFO L470 AbstractCegarLoop]: Abstraction has 15951 states and 23186 transitions. [2021-10-29 05:28:05,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15951 states and 23186 transitions. [2021-10-29 05:28:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-10-29 05:28:05,969 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:05,969 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:28:05,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 05:28:05,969 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1386430113, now seen corresponding path program 1 times [2021-10-29 05:28:05,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:05,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054022192] [2021-10-29 05:28:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:05,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:28:06,038 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:06,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054022192] [2021-10-29 05:28:06,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054022192] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:06,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:06,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:28:06,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468203750] [2021-10-29 05:28:06,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:28:06,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:28:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:28:06,041 INFO L87 Difference]: Start difference. First operand 15951 states and 23186 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:06,795 INFO L93 Difference]: Finished difference Result 30443 states and 44289 transitions. [2021-10-29 05:28:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:28:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-10-29 05:28:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:06,833 INFO L225 Difference]: With dead ends: 30443 [2021-10-29 05:28:06,833 INFO L226 Difference]: Without dead ends: 16035 [2021-10-29 05:28:06,861 INFO L786 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 [2021-10-29 05:28:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16035 states. [2021-10-29 05:28:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16035 to 15951. [2021-10-29 05:28:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15951 states, 15950 states have (on average 1.4450156739811912) internal successors, (23048), 15950 states have internal predecessors, (23048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15951 states to 15951 states and 23048 transitions. [2021-10-29 05:28:07,665 INFO L78 Accepts]: Start accepts. Automaton has 15951 states and 23048 transitions. Word has length 84 [2021-10-29 05:28:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:07,666 INFO L470 AbstractCegarLoop]: Abstraction has 15951 states and 23048 transitions. [2021-10-29 05:28:07,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15951 states and 23048 transitions. [2021-10-29 05:28:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-29 05:28:07,685 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:07,686 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:28:07,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 05:28:07,686 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2048541769, now seen corresponding path program 1 times [2021-10-29 05:28:07,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:07,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956593869] [2021-10-29 05:28:07,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:07,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:28:07,729 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:07,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956593869] [2021-10-29 05:28:07,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956593869] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:07,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:07,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:28:07,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310560521] [2021-10-29 05:28:07,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:07,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:07,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:07,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:07,732 INFO L87 Difference]: Start difference. First operand 15951 states and 23048 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:08,403 INFO L93 Difference]: Finished difference Result 26948 states and 38975 transitions. [2021-10-29 05:28:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-10-29 05:28:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:08,430 INFO L225 Difference]: With dead ends: 26948 [2021-10-29 05:28:08,430 INFO L226 Difference]: Without dead ends: 12540 [2021-10-29 05:28:08,451 INFO L786 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 [2021-10-29 05:28:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12540 states. [2021-10-29 05:28:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12540 to 12204. [2021-10-29 05:28:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12204 states, 12203 states have (on average 1.4109645169220684) internal successors, (17218), 12203 states have internal predecessors, (17218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12204 states to 12204 states and 17218 transitions. [2021-10-29 05:28:09,038 INFO L78 Accepts]: Start accepts. Automaton has 12204 states and 17218 transitions. Word has length 85 [2021-10-29 05:28:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:09,039 INFO L470 AbstractCegarLoop]: Abstraction has 12204 states and 17218 transitions. [2021-10-29 05:28:09,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 12204 states and 17218 transitions. [2021-10-29 05:28:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-29 05:28:09,052 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:09,052 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:28:09,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 05:28:09,052 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash -204040586, now seen corresponding path program 1 times [2021-10-29 05:28:09,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:09,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676213037] [2021-10-29 05:28:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:09,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-29 05:28:09,123 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:09,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676213037] [2021-10-29 05:28:09,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676213037] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:09,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:09,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:28:09,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364290236] [2021-10-29 05:28:09,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:09,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:09,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:09,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:09,126 INFO L87 Difference]: Start difference. First operand 12204 states and 17218 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:09,891 INFO L93 Difference]: Finished difference Result 25642 states and 35812 transitions. [2021-10-29 05:28:09,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:09,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-10-29 05:28:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:09,916 INFO L225 Difference]: With dead ends: 25642 [2021-10-29 05:28:09,916 INFO L226 Difference]: Without dead ends: 13454 [2021-10-29 05:28:09,927 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13454 states. [2021-10-29 05:28:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13454 to 13450. [2021-10-29 05:28:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13450 states, 13449 states have (on average 1.3644880660272138) internal successors, (18351), 13449 states have internal predecessors, (18351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13450 states to 13450 states and 18351 transitions. [2021-10-29 05:28:10,572 INFO L78 Accepts]: Start accepts. Automaton has 13450 states and 18351 transitions. Word has length 86 [2021-10-29 05:28:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:10,573 INFO L470 AbstractCegarLoop]: Abstraction has 13450 states and 18351 transitions. [2021-10-29 05:28:10,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13450 states and 18351 transitions. [2021-10-29 05:28:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-29 05:28:10,587 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:10,587 INFO L513 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, 1, 1] [2021-10-29 05:28:10,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 05:28:10,588 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 419493126, now seen corresponding path program 1 times [2021-10-29 05:28:10,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:10,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682504972] [2021-10-29 05:28:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:10,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:28:10,673 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:10,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682504972] [2021-10-29 05:28:10,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682504972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:10,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:10,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:28:10,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101790758] [2021-10-29 05:28:10,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:28:10,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:28:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:28:10,676 INFO L87 Difference]: Start difference. First operand 13450 states and 18351 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:11,462 INFO L93 Difference]: Finished difference Result 27015 states and 36982 transitions. [2021-10-29 05:28:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:28:11,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-29 05:28:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:11,492 INFO L225 Difference]: With dead ends: 27015 [2021-10-29 05:28:11,492 INFO L226 Difference]: Without dead ends: 17624 [2021-10-29 05:28:11,503 INFO L786 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 [2021-10-29 05:28:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17624 states. [2021-10-29 05:28:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17624 to 14286. [2021-10-29 05:28:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14286 states, 14285 states have (on average 1.3406370318515926) internal successors, (19151), 14285 states have internal predecessors, (19151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14286 states to 14286 states and 19151 transitions. [2021-10-29 05:28:12,244 INFO L78 Accepts]: Start accepts. Automaton has 14286 states and 19151 transitions. Word has length 88 [2021-10-29 05:28:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:12,244 INFO L470 AbstractCegarLoop]: Abstraction has 14286 states and 19151 transitions. [2021-10-29 05:28:12,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 14286 states and 19151 transitions. [2021-10-29 05:28:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-10-29 05:28:12,256 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:12,257 INFO L513 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] [2021-10-29 05:28:12,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 05:28:12,257 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:12,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -493269631, now seen corresponding path program 1 times [2021-10-29 05:28:12,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:12,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584812126] [2021-10-29 05:28:12,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:12,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:28:12,302 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:12,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584812126] [2021-10-29 05:28:12,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584812126] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:12,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:12,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:28:12,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106460975] [2021-10-29 05:28:12,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:12,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:12,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:12,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:12,305 INFO L87 Difference]: Start difference. First operand 14286 states and 19151 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:12,942 INFO L93 Difference]: Finished difference Result 26218 states and 35314 transitions. [2021-10-29 05:28:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:12,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-10-29 05:28:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:12,963 INFO L225 Difference]: With dead ends: 26218 [2021-10-29 05:28:12,963 INFO L226 Difference]: Without dead ends: 14270 [2021-10-29 05:28:12,975 INFO L786 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 [2021-10-29 05:28:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14270 states. [2021-10-29 05:28:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14270 to 14086. [2021-10-29 05:28:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14086 states, 14085 states have (on average 1.3020234291799786) internal successors, (18339), 14085 states have internal predecessors, (18339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 18339 transitions. [2021-10-29 05:28:13,640 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 18339 transitions. Word has length 110 [2021-10-29 05:28:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:13,641 INFO L470 AbstractCegarLoop]: Abstraction has 14086 states and 18339 transitions. [2021-10-29 05:28:13,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 18339 transitions. [2021-10-29 05:28:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-10-29 05:28:13,654 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:13,655 INFO L513 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] [2021-10-29 05:28:13,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 05:28:13,655 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2048164705, now seen corresponding path program 1 times [2021-10-29 05:28:13,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:13,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009529304] [2021-10-29 05:28:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:13,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:28:13,704 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:13,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009529304] [2021-10-29 05:28:13,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009529304] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:13,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:13,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:28:13,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126173209] [2021-10-29 05:28:13,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:13,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:13,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:13,707 INFO L87 Difference]: Start difference. First operand 14086 states and 18339 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:14,516 INFO L93 Difference]: Finished difference Result 25794 states and 33666 transitions. [2021-10-29 05:28:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:14,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-10-29 05:28:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:14,543 INFO L225 Difference]: With dead ends: 25794 [2021-10-29 05:28:14,543 INFO L226 Difference]: Without dead ends: 14086 [2021-10-29 05:28:14,561 INFO L786 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 [2021-10-29 05:28:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14086 states. [2021-10-29 05:28:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14086 to 14086. [2021-10-29 05:28:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14086 states, 14085 states have (on average 1.2790202342917998) internal successors, (18015), 14085 states have internal predecessors, (18015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 18015 transitions. [2021-10-29 05:28:15,183 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 18015 transitions. Word has length 110 [2021-10-29 05:28:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:15,183 INFO L470 AbstractCegarLoop]: Abstraction has 14086 states and 18015 transitions. [2021-10-29 05:28:15,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 18015 transitions. [2021-10-29 05:28:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-29 05:28:15,195 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:15,195 INFO L513 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] [2021-10-29 05:28:15,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 05:28:15,195 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 310856231, now seen corresponding path program 1 times [2021-10-29 05:28:15,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:15,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475469183] [2021-10-29 05:28:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:15,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:28:15,245 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:15,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475469183] [2021-10-29 05:28:15,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475469183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:15,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:15,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:28:15,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029645062] [2021-10-29 05:28:15,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:28:15,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:15,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:28:15,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:28:15,247 INFO L87 Difference]: Start difference. First operand 14086 states and 18015 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:15,883 INFO L93 Difference]: Finished difference Result 29374 states and 38298 transitions. [2021-10-29 05:28:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:28:15,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-10-29 05:28:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:15,906 INFO L225 Difference]: With dead ends: 29374 [2021-10-29 05:28:15,906 INFO L226 Difference]: Without dead ends: 17666 [2021-10-29 05:28:15,920 INFO L786 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 [2021-10-29 05:28:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17666 states. [2021-10-29 05:28:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17666 to 14782. [2021-10-29 05:28:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14782 states, 14781 states have (on average 1.2875312901698126) internal successors, (19031), 14781 states have internal predecessors, (19031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14782 states to 14782 states and 19031 transitions. [2021-10-29 05:28:16,470 INFO L78 Accepts]: Start accepts. Automaton has 14782 states and 19031 transitions. Word has length 113 [2021-10-29 05:28:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:16,470 INFO L470 AbstractCegarLoop]: Abstraction has 14782 states and 19031 transitions. [2021-10-29 05:28:16,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 14782 states and 19031 transitions. [2021-10-29 05:28:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-10-29 05:28:16,484 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:16,484 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:28:16,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 05:28:16,484 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:16,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1867357665, now seen corresponding path program 1 times [2021-10-29 05:28:16,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:16,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211502262] [2021-10-29 05:28:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:16,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:28:16,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:16,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211502262] [2021-10-29 05:28:16,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211502262] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:16,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:16,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:28:16,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916293348] [2021-10-29 05:28:16,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:28:16,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:28:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:28:16,533 INFO L87 Difference]: Start difference. First operand 14782 states and 19031 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:17,076 INFO L93 Difference]: Finished difference Result 28172 states and 36374 transitions. [2021-10-29 05:28:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:28:17,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-10-29 05:28:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:17,099 INFO L225 Difference]: With dead ends: 28172 [2021-10-29 05:28:17,099 INFO L226 Difference]: Without dead ends: 14710 [2021-10-29 05:28:17,112 INFO L786 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 [2021-10-29 05:28:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14710 states. [2021-10-29 05:28:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14710 to 14518. [2021-10-29 05:28:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14518 states, 14517 states have (on average 1.243989805056141) internal successors, (18059), 14517 states have internal predecessors, (18059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14518 states to 14518 states and 18059 transitions. [2021-10-29 05:28:17,733 INFO L78 Accepts]: Start accepts. Automaton has 14518 states and 18059 transitions. Word has length 135 [2021-10-29 05:28:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:17,733 INFO L470 AbstractCegarLoop]: Abstraction has 14518 states and 18059 transitions. [2021-10-29 05:28:17,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 14518 states and 18059 transitions. [2021-10-29 05:28:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-10-29 05:28:17,742 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:17,743 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:28:17,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 05:28:17,743 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1533946912, now seen corresponding path program 1 times [2021-10-29 05:28:17,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:17,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229779048] [2021-10-29 05:28:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:17,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:28:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 05:28:17,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:28:17,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229779048] [2021-10-29 05:28:17,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229779048] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:28:17,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:28:17,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:28:17,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306096214] [2021-10-29 05:28:17,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:28:17,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:28:17,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:28:17,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:28:17,801 INFO L87 Difference]: Start difference. First operand 14518 states and 18059 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:28:18,359 INFO L93 Difference]: Finished difference Result 27644 states and 34446 transitions. [2021-10-29 05:28:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:28:18,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-10-29 05:28:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:28:18,396 INFO L225 Difference]: With dead ends: 27644 [2021-10-29 05:28:18,396 INFO L226 Difference]: Without dead ends: 14462 [2021-10-29 05:28:18,409 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:28:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14462 states. [2021-10-29 05:28:18,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14462 to 14462. [2021-10-29 05:28:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14462 states, 14461 states have (on average 1.2169974413940945) internal successors, (17599), 14461 states have internal predecessors, (17599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14462 states to 14462 states and 17599 transitions. [2021-10-29 05:28:18,960 INFO L78 Accepts]: Start accepts. Automaton has 14462 states and 17599 transitions. Word has length 135 [2021-10-29 05:28:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:28:18,960 INFO L470 AbstractCegarLoop]: Abstraction has 14462 states and 17599 transitions. [2021-10-29 05:28:18,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:28:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 14462 states and 17599 transitions. [2021-10-29 05:28:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-10-29 05:28:18,969 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:28:18,969 INFO L513 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] [2021-10-29 05:28:18,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 05:28:18,969 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:28:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:28:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1392067570, now seen corresponding path program 1 times [2021-10-29 05:28:18,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:28:18,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048992825] [2021-10-29 05:28:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:28:18,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:28:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:28:19,003 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 05:28:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:28:19,215 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 05:28:19,215 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 05:28:19,219 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:28:19,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 05:28:19,224 INFO L731 BasicCegarLoop]: Path program 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] [2021-10-29 05:28:19,230 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:28:19,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:28:19 BoogieIcfgContainer [2021-10-29 05:28:19,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:28:19,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:28:19,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:28:19,483 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:28:19,483 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:27:55" (3/4) ... [2021-10-29 05:28:19,485 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 05:28:19,674 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:28:19,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:28:19,676 INFO L168 Benchmark]: Toolchain (without parser) took 26641.83 ms. Allocated memory was 94.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 54.6 MB in the beginning and 1.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-10-29 05:28:19,676 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory is still 71.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:28:19,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.57 ms. Allocated memory was 94.4 MB in the beginning and 125.8 MB in the end (delta: 31.5 MB). Free memory was 54.4 MB in the beginning and 97.9 MB in the end (delta: -43.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:28:19,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.56 ms. Allocated memory is still 125.8 MB. Free memory was 97.9 MB in the beginning and 93.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:28:19,678 INFO L168 Benchmark]: Boogie Preprocessor took 127.34 ms. Allocated memory is still 125.8 MB. Free memory was 93.8 MB in the beginning and 89.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:28:19,679 INFO L168 Benchmark]: RCFGBuilder took 2348.09 ms. Allocated memory is still 125.8 MB. Free memory was 89.9 MB in the beginning and 47.9 MB in the end (delta: 42.0 MB). Peak memory consumption was 59.9 MB. Max. memory is 16.1 GB. [2021-10-29 05:28:19,679 INFO L168 Benchmark]: TraceAbstraction took 23530.67 ms. Allocated memory was 125.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 47.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2021-10-29 05:28:19,679 INFO L168 Benchmark]: Witness Printer took 191.94 ms. Allocated memory is still 3.1 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 30.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:28:19,682 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory is still 71.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 356.57 ms. Allocated memory was 94.4 MB in the beginning and 125.8 MB in the end (delta: 31.5 MB). Free memory was 54.4 MB in the beginning and 97.9 MB in the end (delta: -43.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 78.56 ms. Allocated memory is still 125.8 MB. Free memory was 97.9 MB in the beginning and 93.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 127.34 ms. Allocated memory is still 125.8 MB. Free memory was 93.8 MB in the beginning and 89.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2348.09 ms. Allocated memory is still 125.8 MB. Free memory was 89.9 MB in the beginning and 47.9 MB in the end (delta: 42.0 MB). Peak memory consumption was 59.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23530.67 ms. Allocated memory was 125.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 47.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. * Witness Printer took 191.94 ms. Allocated memory is still 3.1 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 30.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: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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. OverallTime: 23.1s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7794 SDtfs, 5510 SDslu, 5255 SDs, 0 SdLazy, 608 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15951occurred in iteration=15, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 12013 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1931 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 3235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 287/287 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! [2021-10-29 05:28:19,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2477fed7-376e-4114-8a51-337f9df09289/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...