./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7ce514ec2fc88674c985d5f51e3fdb9c36038f7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 07:37:29,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:37:29,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:37:30,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:37:30,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:37:30,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:37:30,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:37:30,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:37:30,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:37:30,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:37:30,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:37:30,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:37:30,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:37:30,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:37:30,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:37:30,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:37:30,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:37:30,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:37:30,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:37:30,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:37:30,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:37:30,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:37:30,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:37:30,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:37:30,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:37:30,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:37:30,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:37:30,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:37:30,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:37:30,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:37:30,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:37:30,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:37:30,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:37:30,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:37:30,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:37:30,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:37:30,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:37:30,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:37:30,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:37:30,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:37:30,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:37:30,108 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:37:30,139 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:37:30,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:37:30,141 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:37:30,141 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:37:30,141 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:37:30,142 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:37:30,142 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:37:30,142 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:37:30,142 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:37:30,143 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:37:30,143 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:37:30,143 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:37:30,144 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:37:30,144 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:37:30,144 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:37:30,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:37:30,145 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:37:30,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:37:30,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:37:30,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:37:30,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:37:30,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:37:30,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:37:30,147 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:37:30,147 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:37:30,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:37:30,148 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:37:30,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:37:30,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:37:30,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:37:30,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:37:30,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:37:30,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:37:30,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:37:30,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:37:30,150 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:37:30,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:37:30,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:37:30,151 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:37:30,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:37:30,152 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7ce514ec2fc88674c985d5f51e3fdb9c36038f7 [2020-11-28 07:37:30,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:37:30,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:37:30,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:37:30,531 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:37:30,532 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:37:30,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-11-28 07:37:30,626 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/data/505401fd7/48a161e8222e48a4b3725c64201eca0f/FLAG34265194f [2020-11-28 07:37:31,234 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:37:31,238 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-11-28 07:37:31,264 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/data/505401fd7/48a161e8222e48a4b3725c64201eca0f/FLAG34265194f [2020-11-28 07:37:31,499 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/data/505401fd7/48a161e8222e48a4b3725c64201eca0f [2020-11-28 07:37:31,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:37:31,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:37:31,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:37:31,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:37:31,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:37:31,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:37:31" (1/1) ... [2020-11-28 07:37:31,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4884a311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:31, skipping insertion in model container [2020-11-28 07:37:31,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:37:31" (1/1) ... [2020-11-28 07:37:31,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:37:31,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:37:31,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:37:31,930 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:37:32,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:37:32,095 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:37:32,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32 WrapperNode [2020-11-28 07:37:32,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:37:32,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:37:32,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:37:32,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:37:32,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:37:32,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:37:32,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:37:32,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:37:32,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... [2020-11-28 07:37:32,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:37:32,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:37:32,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:37:32,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:37:32,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:37:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:37:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:37:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:37:32,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:37:34,643 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:37:34,643 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-11-28 07:37:34,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:37:34 BoogieIcfgContainer [2020-11-28 07:37:34,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:37:34,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:37:34,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:37:34,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:37:34,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:37:31" (1/3) ... [2020-11-28 07:37:34,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52945419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:37:34, skipping insertion in model container [2020-11-28 07:37:34,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:37:32" (2/3) ... [2020-11-28 07:37:34,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52945419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:37:34, skipping insertion in model container [2020-11-28 07:37:34,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:37:34" (3/3) ... [2020-11-28 07:37:34,659 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-11-28 07:37:34,673 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:37:34,679 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-11-28 07:37:34,694 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-11-28 07:37:34,740 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:37:34,741 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:37:34,741 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:37:34,742 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:37:34,742 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:37:34,742 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:37:34,742 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:37:34,742 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:37:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states. [2020-11-28 07:37:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 07:37:34,770 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:34,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:34,771 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2115519050, now seen corresponding path program 1 times [2020-11-28 07:37:34,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:34,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864247833] [2020-11-28 07:37:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:35,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864247833] [2020-11-28 07:37:35,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:35,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:35,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153086836] [2020-11-28 07:37:35,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:37:35,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:35,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:37:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:35,248 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 3 states. [2020-11-28 07:37:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:35,422 INFO L93 Difference]: Finished difference Result 477 states and 740 transitions. [2020-11-28 07:37:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:37:35,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 07:37:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:35,449 INFO L225 Difference]: With dead ends: 477 [2020-11-28 07:37:35,449 INFO L226 Difference]: Without dead ends: 238 [2020-11-28 07:37:35,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-11-28 07:37:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2020-11-28 07:37:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-11-28 07:37:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2020-11-28 07:37:35,526 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 11 [2020-11-28 07:37:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:35,527 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2020-11-28 07:37:35,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:37:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2020-11-28 07:37:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 07:37:35,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:35,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:35,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:37:35,530 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash -328587072, now seen corresponding path program 1 times [2020-11-28 07:37:35,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:35,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627380979] [2020-11-28 07:37:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:35,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627380979] [2020-11-28 07:37:35,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:35,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:35,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124099020] [2020-11-28 07:37:35,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:37:35,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:37:35,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:35,667 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 4 states. [2020-11-28 07:37:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:35,753 INFO L93 Difference]: Finished difference Result 652 states and 949 transitions. [2020-11-28 07:37:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:37:35,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-28 07:37:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:35,762 INFO L225 Difference]: With dead ends: 652 [2020-11-28 07:37:35,762 INFO L226 Difference]: Without dead ends: 440 [2020-11-28 07:37:35,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:35,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-28 07:37:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 235. [2020-11-28 07:37:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-11-28 07:37:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2020-11-28 07:37:35,796 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 15 [2020-11-28 07:37:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:35,796 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2020-11-28 07:37:35,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:37:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2020-11-28 07:37:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 07:37:35,798 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:35,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:35,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:37:35,799 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1305712864, now seen corresponding path program 1 times [2020-11-28 07:37:35,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:35,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067643050] [2020-11-28 07:37:35,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:35,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067643050] [2020-11-28 07:37:35,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:35,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:37:35,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162937203] [2020-11-28 07:37:35,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:37:35,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:35,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:37:35,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:37:35,892 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 5 states. [2020-11-28 07:37:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:36,028 INFO L93 Difference]: Finished difference Result 861 states and 1252 transitions. [2020-11-28 07:37:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:37:36,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-28 07:37:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:36,034 INFO L225 Difference]: With dead ends: 861 [2020-11-28 07:37:36,035 INFO L226 Difference]: Without dead ends: 649 [2020-11-28 07:37:36,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:37:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-11-28 07:37:36,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 236. [2020-11-28 07:37:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-11-28 07:37:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 344 transitions. [2020-11-28 07:37:36,061 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 344 transitions. Word has length 16 [2020-11-28 07:37:36,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:36,062 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 344 transitions. [2020-11-28 07:37:36,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:37:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 344 transitions. [2020-11-28 07:37:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:37:36,063 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:36,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:36,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:37:36,064 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:36,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:36,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1522829947, now seen corresponding path program 1 times [2020-11-28 07:37:36,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:36,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547237663] [2020-11-28 07:37:36,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:36,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547237663] [2020-11-28 07:37:36,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:36,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:36,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470729981] [2020-11-28 07:37:36,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:37:36,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:36,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:37:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:36,166 INFO L87 Difference]: Start difference. First operand 236 states and 344 transitions. Second operand 4 states. [2020-11-28 07:37:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:36,230 INFO L93 Difference]: Finished difference Result 655 states and 952 transitions. [2020-11-28 07:37:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:37:36,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-28 07:37:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:36,234 INFO L225 Difference]: With dead ends: 655 [2020-11-28 07:37:36,235 INFO L226 Difference]: Without dead ends: 443 [2020-11-28 07:37:36,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2020-11-28 07:37:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 237. [2020-11-28 07:37:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-11-28 07:37:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 345 transitions. [2020-11-28 07:37:36,252 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 345 transitions. Word has length 18 [2020-11-28 07:37:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:36,252 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 345 transitions. [2020-11-28 07:37:36,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:37:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 345 transitions. [2020-11-28 07:37:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:37:36,253 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:36,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:36,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:37:36,254 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1088799969, now seen corresponding path program 1 times [2020-11-28 07:37:36,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:36,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311403709] [2020-11-28 07:37:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:36,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311403709] [2020-11-28 07:37:36,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:36,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:36,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243398508] [2020-11-28 07:37:36,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:37:36,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:37:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:36,340 INFO L87 Difference]: Start difference. First operand 237 states and 345 transitions. Second operand 3 states. [2020-11-28 07:37:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:36,376 INFO L93 Difference]: Finished difference Result 477 states and 696 transitions. [2020-11-28 07:37:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:37:36,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-28 07:37:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:36,379 INFO L225 Difference]: With dead ends: 477 [2020-11-28 07:37:36,379 INFO L226 Difference]: Without dead ends: 265 [2020-11-28 07:37:36,380 INFO L677 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 [2020-11-28 07:37:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-11-28 07:37:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 232. [2020-11-28 07:37:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-28 07:37:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 337 transitions. [2020-11-28 07:37:36,391 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 337 transitions. Word has length 18 [2020-11-28 07:37:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:36,392 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 337 transitions. [2020-11-28 07:37:36,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:37:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 337 transitions. [2020-11-28 07:37:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-28 07:37:36,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:36,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:36,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:37:36,399 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:36,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:36,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1261489019, now seen corresponding path program 1 times [2020-11-28 07:37:36,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:36,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853806574] [2020-11-28 07:37:36,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:36,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853806574] [2020-11-28 07:37:36,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:36,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:36,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702314886] [2020-11-28 07:37:36,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:37:36,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:36,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:37:36,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:36,503 INFO L87 Difference]: Start difference. First operand 232 states and 337 transitions. Second operand 3 states. [2020-11-28 07:37:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:36,593 INFO L93 Difference]: Finished difference Result 476 states and 695 transitions. [2020-11-28 07:37:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:37:36,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-28 07:37:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:36,597 INFO L225 Difference]: With dead ends: 476 [2020-11-28 07:37:36,597 INFO L226 Difference]: Without dead ends: 269 [2020-11-28 07:37:36,598 INFO L677 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 [2020-11-28 07:37:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-11-28 07:37:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 212. [2020-11-28 07:37:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-11-28 07:37:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 305 transitions. [2020-11-28 07:37:36,611 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 305 transitions. Word has length 22 [2020-11-28 07:37:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:36,612 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 305 transitions. [2020-11-28 07:37:36,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:37:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 305 transitions. [2020-11-28 07:37:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 07:37:36,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:36,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:36,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:37:36,620 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1793983211, now seen corresponding path program 1 times [2020-11-28 07:37:36,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:36,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389604612] [2020-11-28 07:37:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:36,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389604612] [2020-11-28 07:37:36,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:36,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:36,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742397113] [2020-11-28 07:37:36,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:37:36,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:36,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:37:36,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:36,726 INFO L87 Difference]: Start difference. First operand 212 states and 305 transitions. Second operand 3 states. [2020-11-28 07:37:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:36,780 INFO L93 Difference]: Finished difference Result 444 states and 639 transitions. [2020-11-28 07:37:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:37:36,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-11-28 07:37:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:36,783 INFO L225 Difference]: With dead ends: 444 [2020-11-28 07:37:36,783 INFO L226 Difference]: Without dead ends: 257 [2020-11-28 07:37:36,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-11-28 07:37:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 200. [2020-11-28 07:37:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-28 07:37:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 287 transitions. [2020-11-28 07:37:36,796 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 287 transitions. Word has length 26 [2020-11-28 07:37:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:36,796 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 287 transitions. [2020-11-28 07:37:36,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:37:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 287 transitions. [2020-11-28 07:37:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 07:37:36,800 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:36,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:36,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 07:37:36,800 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:36,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash 777851705, now seen corresponding path program 1 times [2020-11-28 07:37:36,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:36,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681935918] [2020-11-28 07:37:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:36,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681935918] [2020-11-28 07:37:36,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:36,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:36,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096377505] [2020-11-28 07:37:36,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:37:36,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:37:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:36,874 INFO L87 Difference]: Start difference. First operand 200 states and 287 transitions. Second operand 3 states. [2020-11-28 07:37:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:36,991 INFO L93 Difference]: Finished difference Result 440 states and 631 transitions. [2020-11-28 07:37:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:37:36,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-11-28 07:37:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:36,995 INFO L225 Difference]: With dead ends: 440 [2020-11-28 07:37:36,995 INFO L226 Difference]: Without dead ends: 265 [2020-11-28 07:37:36,996 INFO L677 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 [2020-11-28 07:37:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-11-28 07:37:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 180. [2020-11-28 07:37:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-28 07:37:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 255 transitions. [2020-11-28 07:37:37,009 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 255 transitions. Word has length 27 [2020-11-28 07:37:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:37,011 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 255 transitions. [2020-11-28 07:37:37,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:37:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 255 transitions. [2020-11-28 07:37:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-28 07:37:37,014 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:37,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:37,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 07:37:37,015 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:37,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1151151741, now seen corresponding path program 1 times [2020-11-28 07:37:37,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:37,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599463462] [2020-11-28 07:37:37,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:37,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599463462] [2020-11-28 07:37:37,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:37,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:37:37,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265662469] [2020-11-28 07:37:37,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:37:37,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:37,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:37:37,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:37,245 INFO L87 Difference]: Start difference. First operand 180 states and 255 transitions. Second operand 4 states. [2020-11-28 07:37:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:37,304 INFO L93 Difference]: Finished difference Result 512 states and 717 transitions. [2020-11-28 07:37:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:37:37,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-11-28 07:37:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:37,308 INFO L225 Difference]: With dead ends: 512 [2020-11-28 07:37:37,308 INFO L226 Difference]: Without dead ends: 342 [2020-11-28 07:37:37,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-11-28 07:37:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 184. [2020-11-28 07:37:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-28 07:37:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2020-11-28 07:37:37,324 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 259 transitions. Word has length 32 [2020-11-28 07:37:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:37,325 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 259 transitions. [2020-11-28 07:37:37,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:37:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 259 transitions. [2020-11-28 07:37:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-28 07:37:37,326 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:37,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:37,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 07:37:37,327 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:37,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1383053401, now seen corresponding path program 1 times [2020-11-28 07:37:37,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:37,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749754826] [2020-11-28 07:37:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:37,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749754826] [2020-11-28 07:37:37,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:37,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:37:37,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309650746] [2020-11-28 07:37:37,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:37:37,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:37:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:37:37,501 INFO L87 Difference]: Start difference. First operand 184 states and 259 transitions. Second operand 6 states. [2020-11-28 07:37:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:37,721 INFO L93 Difference]: Finished difference Result 629 states and 873 transitions. [2020-11-28 07:37:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 07:37:37,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-11-28 07:37:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:37,725 INFO L225 Difference]: With dead ends: 629 [2020-11-28 07:37:37,725 INFO L226 Difference]: Without dead ends: 472 [2020-11-28 07:37:37,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-28 07:37:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-11-28 07:37:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 219. [2020-11-28 07:37:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-11-28 07:37:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 309 transitions. [2020-11-28 07:37:37,745 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 309 transitions. Word has length 34 [2020-11-28 07:37:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:37,746 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 309 transitions. [2020-11-28 07:37:37,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:37:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 309 transitions. [2020-11-28 07:37:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 07:37:37,747 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:37,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:37,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 07:37:37,748 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash 323710444, now seen corresponding path program 1 times [2020-11-28 07:37:37,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:37,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263317708] [2020-11-28 07:37:37,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:37,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263317708] [2020-11-28 07:37:37,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:37,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:37,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907894130] [2020-11-28 07:37:37,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:37:37,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:37:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:37,806 INFO L87 Difference]: Start difference. First operand 219 states and 309 transitions. Second operand 3 states. [2020-11-28 07:37:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:37,861 INFO L93 Difference]: Finished difference Result 399 states and 564 transitions. [2020-11-28 07:37:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:37:37,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-28 07:37:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:37,864 INFO L225 Difference]: With dead ends: 399 [2020-11-28 07:37:37,864 INFO L226 Difference]: Without dead ends: 242 [2020-11-28 07:37:37,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-11-28 07:37:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2020-11-28 07:37:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-28 07:37:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2020-11-28 07:37:37,881 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 35 [2020-11-28 07:37:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:37,881 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2020-11-28 07:37:37,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:37:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2020-11-28 07:37:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 07:37:37,882 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:37,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:37,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 07:37:37,883 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:37,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1803949990, now seen corresponding path program 1 times [2020-11-28 07:37:37,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:37,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072610035] [2020-11-28 07:37:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:37,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072610035] [2020-11-28 07:37:37,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:37,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:37,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028864753] [2020-11-28 07:37:37,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:37:37,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:37,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:37:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:37,971 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand 3 states. [2020-11-28 07:37:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:38,061 INFO L93 Difference]: Finished difference Result 457 states and 637 transitions. [2020-11-28 07:37:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:37:38,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-28 07:37:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:38,063 INFO L225 Difference]: With dead ends: 457 [2020-11-28 07:37:38,064 INFO L226 Difference]: Without dead ends: 287 [2020-11-28 07:37:38,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:37:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-11-28 07:37:38,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2020-11-28 07:37:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-11-28 07:37:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2020-11-28 07:37:38,081 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 35 [2020-11-28 07:37:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:38,081 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2020-11-28 07:37:38,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:37:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2020-11-28 07:37:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-28 07:37:38,082 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:38,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:38,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 07:37:38,083 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:38,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash -455517555, now seen corresponding path program 1 times [2020-11-28 07:37:38,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:38,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260616197] [2020-11-28 07:37:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:38,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260616197] [2020-11-28 07:37:38,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:38,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 07:37:38,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871120345] [2020-11-28 07:37:38,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:37:38,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:37:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:37:38,234 INFO L87 Difference]: Start difference. First operand 199 states and 276 transitions. Second operand 6 states. [2020-11-28 07:37:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:38,667 INFO L93 Difference]: Finished difference Result 881 states and 1208 transitions. [2020-11-28 07:37:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 07:37:38,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-11-28 07:37:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:38,676 INFO L225 Difference]: With dead ends: 881 [2020-11-28 07:37:38,676 INFO L226 Difference]: Without dead ends: 722 [2020-11-28 07:37:38,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-28 07:37:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2020-11-28 07:37:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 252. [2020-11-28 07:37:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-11-28 07:37:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 347 transitions. [2020-11-28 07:37:38,707 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 347 transitions. Word has length 38 [2020-11-28 07:37:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:38,707 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 347 transitions. [2020-11-28 07:37:38,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:37:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 347 transitions. [2020-11-28 07:37:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-28 07:37:38,708 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:38,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:38,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 07:37:38,709 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash 550957106, now seen corresponding path program 1 times [2020-11-28 07:37:38,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:38,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383205964] [2020-11-28 07:37:38,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:38,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383205964] [2020-11-28 07:37:38,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:38,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:37:38,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343705014] [2020-11-28 07:37:38,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:37:38,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:38,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:37:38,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:38,791 INFO L87 Difference]: Start difference. First operand 252 states and 347 transitions. Second operand 4 states. [2020-11-28 07:37:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:38,912 INFO L93 Difference]: Finished difference Result 712 states and 975 transitions. [2020-11-28 07:37:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:37:38,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-11-28 07:37:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:38,916 INFO L225 Difference]: With dead ends: 712 [2020-11-28 07:37:38,916 INFO L226 Difference]: Without dead ends: 534 [2020-11-28 07:37:38,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:37:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-11-28 07:37:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 368. [2020-11-28 07:37:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-11-28 07:37:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 498 transitions. [2020-11-28 07:37:38,956 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 498 transitions. Word has length 38 [2020-11-28 07:37:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:38,957 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 498 transitions. [2020-11-28 07:37:38,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:37:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 498 transitions. [2020-11-28 07:37:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 07:37:38,959 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:38,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:38,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 07:37:38,960 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash 990723155, now seen corresponding path program 1 times [2020-11-28 07:37:38,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:38,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316031655] [2020-11-28 07:37:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:39,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316031655] [2020-11-28 07:37:39,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:39,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:37:39,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328281705] [2020-11-28 07:37:39,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:37:39,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:39,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:37:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:39,055 INFO L87 Difference]: Start difference. First operand 368 states and 498 transitions. Second operand 4 states. [2020-11-28 07:37:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:39,207 INFO L93 Difference]: Finished difference Result 594 states and 813 transitions. [2020-11-28 07:37:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:37:39,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-28 07:37:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:39,211 INFO L225 Difference]: With dead ends: 594 [2020-11-28 07:37:39,211 INFO L226 Difference]: Without dead ends: 592 [2020-11-28 07:37:39,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:37:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-11-28 07:37:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 370. [2020-11-28 07:37:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-11-28 07:37:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 500 transitions. [2020-11-28 07:37:39,249 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 500 transitions. Word has length 39 [2020-11-28 07:37:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:39,249 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 500 transitions. [2020-11-28 07:37:39,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:37:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 500 transitions. [2020-11-28 07:37:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 07:37:39,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:39,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:39,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 07:37:39,254 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1913158580, now seen corresponding path program 1 times [2020-11-28 07:37:39,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:39,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141497529] [2020-11-28 07:37:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:39,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141497529] [2020-11-28 07:37:39,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:39,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-28 07:37:39,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393756607] [2020-11-28 07:37:39,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-28 07:37:39,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-28 07:37:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-28 07:37:39,543 INFO L87 Difference]: Start difference. First operand 370 states and 500 transitions. Second operand 10 states. [2020-11-28 07:37:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:40,435 INFO L93 Difference]: Finished difference Result 1298 states and 1765 transitions. [2020-11-28 07:37:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-28 07:37:40,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2020-11-28 07:37:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:40,442 INFO L225 Difference]: With dead ends: 1298 [2020-11-28 07:37:40,442 INFO L226 Difference]: Without dead ends: 1056 [2020-11-28 07:37:40,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-11-28 07:37:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2020-11-28 07:37:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 374. [2020-11-28 07:37:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-11-28 07:37:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 505 transitions. [2020-11-28 07:37:40,486 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 505 transitions. Word has length 39 [2020-11-28 07:37:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:40,487 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 505 transitions. [2020-11-28 07:37:40,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-28 07:37:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 505 transitions. [2020-11-28 07:37:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-28 07:37:40,487 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:40,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:40,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 07:37:40,489 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1799455513, now seen corresponding path program 1 times [2020-11-28 07:37:40,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:40,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046077704] [2020-11-28 07:37:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:40,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046077704] [2020-11-28 07:37:40,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:40,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:37:40,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854321500] [2020-11-28 07:37:40,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:37:40,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:37:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:37:40,662 INFO L87 Difference]: Start difference. First operand 374 states and 505 transitions. Second operand 5 states. [2020-11-28 07:37:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:40,746 INFO L93 Difference]: Finished difference Result 684 states and 939 transitions. [2020-11-28 07:37:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:37:40,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-11-28 07:37:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:40,749 INFO L225 Difference]: With dead ends: 684 [2020-11-28 07:37:40,749 INFO L226 Difference]: Without dead ends: 442 [2020-11-28 07:37:40,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:37:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-28 07:37:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 370. [2020-11-28 07:37:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-11-28 07:37:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 498 transitions. [2020-11-28 07:37:40,795 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 498 transitions. Word has length 40 [2020-11-28 07:37:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:40,795 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 498 transitions. [2020-11-28 07:37:40,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:37:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 498 transitions. [2020-11-28 07:37:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-28 07:37:40,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:40,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:40,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 07:37:40,797 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:40,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:40,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2037233143, now seen corresponding path program 1 times [2020-11-28 07:37:40,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:40,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280844755] [2020-11-28 07:37:40,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:40,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280844755] [2020-11-28 07:37:40,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:40,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:37:40,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37815930] [2020-11-28 07:37:40,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:37:40,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:40,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:37:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:37:40,838 INFO L87 Difference]: Start difference. First operand 370 states and 498 transitions. Second operand 4 states. [2020-11-28 07:37:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:40,941 INFO L93 Difference]: Finished difference Result 822 states and 1098 transitions. [2020-11-28 07:37:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:37:40,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-11-28 07:37:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:40,945 INFO L225 Difference]: With dead ends: 822 [2020-11-28 07:37:40,945 INFO L226 Difference]: Without dead ends: 484 [2020-11-28 07:37:40,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:37:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-11-28 07:37:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 324. [2020-11-28 07:37:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-11-28 07:37:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 431 transitions. [2020-11-28 07:37:41,016 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 431 transitions. Word has length 40 [2020-11-28 07:37:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:41,017 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 431 transitions. [2020-11-28 07:37:41,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:37:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 431 transitions. [2020-11-28 07:37:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-28 07:37:41,018 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:41,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:41,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 07:37:41,018 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1310152857, now seen corresponding path program 1 times [2020-11-28 07:37:41,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:41,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948125740] [2020-11-28 07:37:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:37:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:37:41,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948125740] [2020-11-28 07:37:41,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:37:41,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 07:37:41,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246570079] [2020-11-28 07:37:41,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:37:41,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:37:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:37:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:37:41,178 INFO L87 Difference]: Start difference. First operand 324 states and 431 transitions. Second operand 6 states. [2020-11-28 07:37:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:37:41,756 INFO L93 Difference]: Finished difference Result 1537 states and 2046 transitions. [2020-11-28 07:37:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 07:37:41,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-11-28 07:37:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:37:41,764 INFO L225 Difference]: With dead ends: 1537 [2020-11-28 07:37:41,764 INFO L226 Difference]: Without dead ends: 1281 [2020-11-28 07:37:41,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-28 07:37:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2020-11-28 07:37:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 404. [2020-11-28 07:37:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-11-28 07:37:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 531 transitions. [2020-11-28 07:37:41,828 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 531 transitions. Word has length 40 [2020-11-28 07:37:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:37:41,828 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 531 transitions. [2020-11-28 07:37:41,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:37:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 531 transitions. [2020-11-28 07:37:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-28 07:37:41,829 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:37:41,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:37:41,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 07:37:41,830 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:37:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:37:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1959709621, now seen corresponding path program 1 times [2020-11-28 07:37:41,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:37:41,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479470306] [2020-11-28 07:37:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:37:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:37:41,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:37:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:37:41,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:37:42,006 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-28 07:37:42,006 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 07:37:42,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 07:37:42,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:37:42 BoogieIcfgContainer [2020-11-28 07:37:42,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:37:42,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:37:42,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:37:42,165 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:37:42,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:37:34" (3/4) ... [2020-11-28 07:37:42,167 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 07:37:42,347 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_49139ec1-13c4-407e-97e8-2291a745afec/bin/utaipan/witness.graphml [2020-11-28 07:37:42,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:37:42,350 INFO L168 Benchmark]: Toolchain (without parser) took 10844.49 ms. Allocated memory was 94.4 MB in the beginning and 228.6 MB in the end (delta: 134.2 MB). Free memory was 64.0 MB in the beginning and 114.0 MB in the end (delta: -50.1 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.1 GB. [2020-11-28 07:37:42,351 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory was 53.0 MB in the beginning and 53.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:37:42,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.47 ms. Allocated memory is still 94.4 MB. Free memory was 64.0 MB in the beginning and 65.1 MB in the end (delta: -1.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 07:37:42,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.17 ms. Allocated memory is still 94.4 MB. Free memory was 64.6 MB in the beginning and 60.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:37:42,352 INFO L168 Benchmark]: Boogie Preprocessor took 112.87 ms. Allocated memory is still 94.4 MB. Free memory was 60.0 MB in the beginning and 56.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:37:42,352 INFO L168 Benchmark]: RCFGBuilder took 2340.35 ms. Allocated memory was 94.4 MB in the beginning and 121.6 MB in the end (delta: 27.3 MB). Free memory was 56.3 MB in the beginning and 66.2 MB in the end (delta: -9.9 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:37:42,353 INFO L168 Benchmark]: TraceAbstraction took 7515.72 ms. Allocated memory was 121.6 MB in the beginning and 228.6 MB in the end (delta: 107.0 MB). Free memory was 66.2 MB in the beginning and 130.8 MB in the end (delta: -64.6 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:37:42,353 INFO L168 Benchmark]: Witness Printer took 183.53 ms. Allocated memory is still 228.6 MB. Free memory was 130.8 MB in the beginning and 114.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 07:37:42,355 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 was 53.0 MB in the beginning and 53.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 589.47 ms. Allocated memory is still 94.4 MB. Free memory was 64.0 MB in the beginning and 65.1 MB in the end (delta: -1.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.17 ms. Allocated memory is still 94.4 MB. Free memory was 64.6 MB in the beginning and 60.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 112.87 ms. Allocated memory is still 94.4 MB. Free memory was 60.0 MB in the beginning and 56.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2340.35 ms. Allocated memory was 94.4 MB in the beginning and 121.6 MB in the end (delta: 27.3 MB). Free memory was 56.3 MB in the beginning and 66.2 MB in the end (delta: -9.9 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7515.72 ms. Allocated memory was 121.6 MB in the beginning and 228.6 MB in the end (delta: 107.0 MB). Free memory was 66.2 MB in the beginning and 130.8 MB in the end (delta: -64.6 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. * Witness Printer took 183.53 ms. Allocated memory is still 228.6 MB. Free memory was 130.8 MB in the beginning and 114.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L421] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; [L543] int c1 ; [L544] int i2 ; [L547] c1 = 0 [L548] side1Failed = __VERIFIER_nondet_bool() [L549] side2Failed = __VERIFIER_nondet_bool() [L550] side1_written = __VERIFIER_nondet_char() [L551] side2_written = __VERIFIER_nondet_char() [L552] side1Failed_History_0 = __VERIFIER_nondet_bool() [L553] side1Failed_History_1 = __VERIFIER_nondet_bool() [L554] side1Failed_History_2 = __VERIFIER_nondet_bool() [L555] side2Failed_History_0 = __VERIFIER_nondet_bool() [L556] side2Failed_History_1 = __VERIFIER_nondet_bool() [L557] side2Failed_History_2 = __VERIFIER_nondet_bool() [L558] active_side_History_0 = __VERIFIER_nondet_char() [L559] active_side_History_1 = __VERIFIER_nondet_char() [L560] active_side_History_2 = __VERIFIER_nondet_char() [L561] manual_selection_History_0 = __VERIFIER_nondet_char() [L562] manual_selection_History_1 = __VERIFIER_nondet_char() [L563] manual_selection_History_2 = __VERIFIER_nondet_char() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L564] i2 = init() [L58] COND FALSE !(!cond) [L566] cs1_old = nomsg [L567] cs1_new = nomsg [L568] cs2_old = nomsg [L569] cs2_new = nomsg [L570] s1s2_old = nomsg [L571] s1s2_new = nomsg [L572] s1s1_old = nomsg [L573] s1s1_new = nomsg [L574] s2s1_old = nomsg [L575] s2s1_new = nomsg [L576] s2s2_old = nomsg [L577] s2s2_new = nomsg [L578] s1p_old = nomsg [L579] s1p_new = nomsg [L580] s2p_old = nomsg [L581] s2p_new = nomsg [L582] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L583] COND TRUE i2 < 10 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L589] cs1_old = cs1_new [L590] cs1_new = nomsg [L591] cs2_old = cs2_new [L592] cs2_new = nomsg [L593] s1s2_old = s1s2_new [L594] s1s2_new = nomsg [L595] s1s1_old = s1s1_new [L596] s1s1_new = nomsg [L597] s2s1_old = s2s1_new [L598] s2s1_new = nomsg [L599] s2s2_old = s2s2_new [L600] s2s2_new = nomsg [L601] s1p_old = s1p_new [L602] s1p_new = nomsg [L603] s2p_old = s2p_new [L604] s2p_new = nomsg [L424] int tmp ; [L425] msg_t tmp___0 ; [L426] _Bool tmp___1 ; [L427] _Bool tmp___2 ; [L428] _Bool tmp___3 ; [L429] _Bool tmp___4 ; [L430] int8_t tmp___5 ; [L431] _Bool tmp___6 ; [L432] _Bool tmp___7 ; [L433] _Bool tmp___8 ; [L434] int8_t tmp___9 ; [L435] _Bool tmp___10 ; [L436] _Bool tmp___11 ; [L437] _Bool tmp___12 ; [L438] msg_t tmp___13 ; [L439] _Bool tmp___14 ; [L440] _Bool tmp___15 ; [L441] _Bool tmp___16 ; [L442] _Bool tmp___17 ; [L443] int8_t tmp___18 ; [L444] int8_t tmp___19 ; [L445] int8_t tmp___20 ; [L448] COND TRUE ! side1Failed [L449] tmp = 1 [L58] COND FALSE !(!cond) [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L457] tmp___0 = read_manual_selection_history((unsigned char)1) [L458] COND TRUE ! tmp___0 [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L459] tmp___1 = read_side1_failed_history((unsigned char)1) [L460] COND TRUE ! tmp___1 [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L461] tmp___2 = read_side1_failed_history((unsigned char)0) [L462] COND TRUE ! tmp___2 [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L463] tmp___3 = read_side2_failed_history((unsigned char)1) [L464] COND TRUE ! tmp___3 [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L465] tmp___4 = read_side2_failed_history((unsigned char)0) [L466] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L467] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L472] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L477] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] COND TRUE ! ((int )side2_written == 0) [L479] return (0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] c1 = check() [L618] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c", 3, "reach_error") VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 238 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6121 SDtfs, 7817 SDslu, 11245 SDs, 0 SdLazy, 941 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 4256 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 69457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...