./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2255bd39401605e8aa4bbdae0287bc8d412fffe .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.25-f470102 [2019-12-07 12:42:02,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:42:02,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:42:02,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:42:02,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:42:02,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:42:02,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:42:02,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:42:02,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:42:02,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:42:02,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:42:02,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:42:02,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:42:02,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:42:02,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:42:02,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:42:02,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:42:02,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:42:02,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:42:02,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:42:02,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:42:02,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:42:02,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:42:02,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:42:02,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:42:02,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:42:02,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:42:02,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:42:02,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:42:02,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:42:02,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:42:02,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:42:02,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:42:02,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:42:02,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:42:02,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:42:02,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:42:02,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:42:02,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:42:02,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:42:02,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:42:02,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:42:02,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:42:02,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:42:02,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:42:02,085 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:42:02,085 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:42:02,085 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:42:02,085 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:42:02,085 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:42:02,085 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:42:02,086 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:42:02,086 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:42:02,086 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:42:02,086 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:42:02,086 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:42:02,086 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:42:02,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:42:02,087 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:42:02,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:42:02,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:42:02,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:42:02,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:42:02,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:42:02,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:42:02,088 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:42:02,088 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:42:02,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:42:02,088 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:42:02,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:42:02,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:42:02,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:42:02,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:42:02,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:42:02,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:42:02,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:42:02,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:42:02,089 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:42:02,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:42:02,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:42:02,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:42:02,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:42:02,089 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_99866362-a10f-4dcd-9f41-563e5d774f52/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(__VERIFIER_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 -> a2255bd39401605e8aa4bbdae0287bc8d412fffe [2019-12-07 12:42:02,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:42:02,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:42:02,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:42:02,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:42:02,200 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:42:02,201 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-12-07 12:42:02,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/data/aaaf8ca5d/71776a48edd14ee5a00e63c22a83d1fb/FLAG464448886 [2019-12-07 12:42:02,626 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:42:02,626 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-12-07 12:42:02,635 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/data/aaaf8ca5d/71776a48edd14ee5a00e63c22a83d1fb/FLAG464448886 [2019-12-07 12:42:02,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/data/aaaf8ca5d/71776a48edd14ee5a00e63c22a83d1fb [2019-12-07 12:42:02,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:42:02,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:42:02,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:42:02,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:42:02,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:42:02,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:02,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2b2671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02, skipping insertion in model container [2019-12-07 12:42:02,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:02,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:42:02,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:42:02,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:42:02,882 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:42:02,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:42:02,930 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:42:02,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02 WrapperNode [2019-12-07 12:42:02,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:42:02,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:42:02,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:42:02,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:42:02,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:02,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:02,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:42:02,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:42:02,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:42:02,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:42:02,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:02,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:03,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:03,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:03,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:03,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:03,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... [2019-12-07 12:42:03,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:42:03,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:42:03,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:42:03,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:42:03,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/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 [2019-12-07 12:42:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:42:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:42:04,596 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:42:04,596 INFO L287 CfgBuilder]: Removed 173 assume(true) statements. [2019-12-07 12:42:04,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:04 BoogieIcfgContainer [2019-12-07 12:42:04,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:42:04,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:42:04,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:42:04,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:42:04,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:42:02" (1/3) ... [2019-12-07 12:42:04,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c06bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:42:04, skipping insertion in model container [2019-12-07 12:42:04,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:02" (2/3) ... [2019-12-07 12:42:04,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c06bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:42:04, skipping insertion in model container [2019-12-07 12:42:04,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:04" (3/3) ... [2019-12-07 12:42:04,603 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-12-07 12:42:04,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:42:04,614 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-12-07 12:42:04,622 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-12-07 12:42:04,640 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:42:04,640 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:42:04,640 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:42:04,640 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:42:04,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:42:04,641 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:42:04,641 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:42:04,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:42:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states. [2019-12-07 12:42:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:42:04,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:04,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:04,664 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1942898753, now seen corresponding path program 1 times [2019-12-07 12:42:04,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:04,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842209970] [2019-12-07 12:42:04,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:04,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842209970] [2019-12-07 12:42:04,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:04,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:04,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436468934] [2019-12-07 12:42:04,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:04,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:04,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:04,801 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 3 states. [2019-12-07 12:42:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:04,964 INFO L93 Difference]: Finished difference Result 821 states and 1255 transitions. [2019-12-07 12:42:04,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:04,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 12:42:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:04,981 INFO L225 Difference]: With dead ends: 821 [2019-12-07 12:42:04,981 INFO L226 Difference]: Without dead ends: 489 [2019-12-07 12:42:04,984 INFO L630 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 [2019-12-07 12:42:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-12-07 12:42:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 296. [2019-12-07 12:42:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-12-07 12:42:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 417 transitions. [2019-12-07 12:42:05,027 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 417 transitions. Word has length 8 [2019-12-07 12:42:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,027 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 417 transitions. [2019-12-07 12:42:05,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 417 transitions. [2019-12-07 12:42:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:42:05,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,028 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1690635635, now seen corresponding path program 1 times [2019-12-07 12:42:05,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483729534] [2019-12-07 12:42:05,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:05,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483729534] [2019-12-07 12:42:05,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:05,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328076147] [2019-12-07 12:42:05,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,054 INFO L87 Difference]: Start difference. First operand 296 states and 417 transitions. Second operand 3 states. [2019-12-07 12:42:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,091 INFO L93 Difference]: Finished difference Result 729 states and 1020 transitions. [2019-12-07 12:42:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:42:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,094 INFO L225 Difference]: With dead ends: 729 [2019-12-07 12:42:05,094 INFO L226 Difference]: Without dead ends: 434 [2019-12-07 12:42:05,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-07 12:42:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 277. [2019-12-07 12:42:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 12:42:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 387 transitions. [2019-12-07 12:42:05,108 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 387 transitions. Word has length 9 [2019-12-07 12:42:05,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,108 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 387 transitions. [2019-12-07 12:42:05,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 387 transitions. [2019-12-07 12:42:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:42:05,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,110 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1432511211, now seen corresponding path program 1 times [2019-12-07 12:42:05,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954068988] [2019-12-07 12:42:05,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:05,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954068988] [2019-12-07 12:42:05,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:05,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15437486] [2019-12-07 12:42:05,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,132 INFO L87 Difference]: Start difference. First operand 277 states and 387 transitions. Second operand 3 states. [2019-12-07 12:42:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,163 INFO L93 Difference]: Finished difference Result 817 states and 1142 transitions. [2019-12-07 12:42:05,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 12:42:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,166 INFO L225 Difference]: With dead ends: 817 [2019-12-07 12:42:05,166 INFO L226 Difference]: Without dead ends: 547 [2019-12-07 12:42:05,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-12-07 12:42:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 281. [2019-12-07 12:42:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-12-07 12:42:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2019-12-07 12:42:05,176 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 11 [2019-12-07 12:42:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,176 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2019-12-07 12:42:05,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2019-12-07 12:42:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:42:05,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,177 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1340659183, now seen corresponding path program 1 times [2019-12-07 12:42:05,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095005641] [2019-12-07 12:42:05,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:05,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095005641] [2019-12-07 12:42:05,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:05,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575348860] [2019-12-07 12:42:05,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,205 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand 3 states. [2019-12-07 12:42:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,216 INFO L93 Difference]: Finished difference Result 433 states and 597 transitions. [2019-12-07 12:42:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 12:42:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,218 INFO L225 Difference]: With dead ends: 433 [2019-12-07 12:42:05,218 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 12:42:05,219 INFO L630 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 [2019-12-07 12:42:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 12:42:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-12-07 12:42:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-12-07 12:42:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 388 transitions. [2019-12-07 12:42:05,225 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 388 transitions. Word has length 15 [2019-12-07 12:42:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,225 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 388 transitions. [2019-12-07 12:42:05,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 388 transitions. [2019-12-07 12:42:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:42:05,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,226 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash 565061684, now seen corresponding path program 1 times [2019-12-07 12:42:05,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609535138] [2019-12-07 12:42:05,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:05,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609535138] [2019-12-07 12:42:05,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:42:05,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62056720] [2019-12-07 12:42:05,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:05,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:05,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:05,253 INFO L87 Difference]: Start difference. First operand 281 states and 388 transitions. Second operand 4 states. [2019-12-07 12:42:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,294 INFO L93 Difference]: Finished difference Result 711 states and 977 transitions. [2019-12-07 12:42:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:05,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:42:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,297 INFO L225 Difference]: With dead ends: 711 [2019-12-07 12:42:05,297 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 12:42:05,298 INFO L630 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 [2019-12-07 12:42:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 12:42:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 281. [2019-12-07 12:42:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-12-07 12:42:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 387 transitions. [2019-12-07 12:42:05,308 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 387 transitions. Word has length 16 [2019-12-07 12:42:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,308 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 387 transitions. [2019-12-07 12:42:05,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 387 transitions. [2019-12-07 12:42:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:42:05,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,310 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1997031187, now seen corresponding path program 1 times [2019-12-07 12:42:05,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143914406] [2019-12-07 12:42:05,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:42:05,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143914406] [2019-12-07 12:42:05,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:05,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510244239] [2019-12-07 12:42:05,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,341 INFO L87 Difference]: Start difference. First operand 281 states and 387 transitions. Second operand 3 states. [2019-12-07 12:42:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,417 INFO L93 Difference]: Finished difference Result 692 states and 960 transitions. [2019-12-07 12:42:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:42:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,419 INFO L225 Difference]: With dead ends: 692 [2019-12-07 12:42:05,419 INFO L226 Difference]: Without dead ends: 422 [2019-12-07 12:42:05,420 INFO L630 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 [2019-12-07 12:42:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-07 12:42:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 256. [2019-12-07 12:42:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 12:42:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 347 transitions. [2019-12-07 12:42:05,426 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 347 transitions. Word has length 18 [2019-12-07 12:42:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,426 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 347 transitions. [2019-12-07 12:42:05,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 347 transitions. [2019-12-07 12:42:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:42:05,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,427 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -54435551, now seen corresponding path program 1 times [2019-12-07 12:42:05,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519412862] [2019-12-07 12:42:05,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:42:05,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519412862] [2019-12-07 12:42:05,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:05,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354807124] [2019-12-07 12:42:05,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,446 INFO L87 Difference]: Start difference. First operand 256 states and 347 transitions. Second operand 3 states. [2019-12-07 12:42:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,481 INFO L93 Difference]: Finished difference Result 630 states and 855 transitions. [2019-12-07 12:42:05,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:42:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,484 INFO L225 Difference]: With dead ends: 630 [2019-12-07 12:42:05,484 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 12:42:05,485 INFO L630 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 [2019-12-07 12:42:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 12:42:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 240. [2019-12-07 12:42:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 12:42:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 321 transitions. [2019-12-07 12:42:05,492 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 321 transitions. Word has length 18 [2019-12-07 12:42:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,493 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 321 transitions. [2019-12-07 12:42:05,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 321 transitions. [2019-12-07 12:42:05,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:42:05,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,494 INFO L410 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] [2019-12-07 12:42:05,494 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,494 INFO L82 PathProgramCache]: Analyzing trace with hash -140817968, now seen corresponding path program 1 times [2019-12-07 12:42:05,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724418584] [2019-12-07 12:42:05,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:42:05,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724418584] [2019-12-07 12:42:05,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:42:05,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152904791] [2019-12-07 12:42:05,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:05,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:05,528 INFO L87 Difference]: Start difference. First operand 240 states and 321 transitions. Second operand 4 states. [2019-12-07 12:42:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,562 INFO L93 Difference]: Finished difference Result 606 states and 813 transitions. [2019-12-07 12:42:05,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:05,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 12:42:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,564 INFO L225 Difference]: With dead ends: 606 [2019-12-07 12:42:05,564 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 12:42:05,564 INFO L630 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 [2019-12-07 12:42:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 12:42:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 240. [2019-12-07 12:42:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 12:42:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 320 transitions. [2019-12-07 12:42:05,570 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 320 transitions. Word has length 27 [2019-12-07 12:42:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,570 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 320 transitions. [2019-12-07 12:42:05,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 320 transitions. [2019-12-07 12:42:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:42:05,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,571 INFO L410 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] [2019-12-07 12:42:05,571 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1596084722, now seen corresponding path program 1 times [2019-12-07 12:42:05,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530112325] [2019-12-07 12:42:05,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:42:05,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530112325] [2019-12-07 12:42:05,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:05,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827539949] [2019-12-07 12:42:05,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,597 INFO L87 Difference]: Start difference. First operand 240 states and 320 transitions. Second operand 3 states. [2019-12-07 12:42:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,640 INFO L93 Difference]: Finished difference Result 584 states and 787 transitions. [2019-12-07 12:42:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:42:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,643 INFO L225 Difference]: With dead ends: 584 [2019-12-07 12:42:05,643 INFO L226 Difference]: Without dead ends: 366 [2019-12-07 12:42:05,644 INFO L630 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 [2019-12-07 12:42:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-12-07 12:42:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 223. [2019-12-07 12:42:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 12:42:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 294 transitions. [2019-12-07 12:42:05,651 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 294 transitions. Word has length 29 [2019-12-07 12:42:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,652 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 294 transitions. [2019-12-07 12:42:05,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 294 transitions. [2019-12-07 12:42:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:42:05,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,653 INFO L410 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] [2019-12-07 12:42:05,653 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,653 INFO L82 PathProgramCache]: Analyzing trace with hash 179104351, now seen corresponding path program 1 times [2019-12-07 12:42:05,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180987054] [2019-12-07 12:42:05,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:42:05,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180987054] [2019-12-07 12:42:05,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:05,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945883254] [2019-12-07 12:42:05,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,681 INFO L87 Difference]: Start difference. First operand 223 states and 294 transitions. Second operand 3 states. [2019-12-07 12:42:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,727 INFO L93 Difference]: Finished difference Result 499 states and 667 transitions. [2019-12-07 12:42:05,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 12:42:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,729 INFO L225 Difference]: With dead ends: 499 [2019-12-07 12:42:05,730 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 12:42:05,730 INFO L630 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 [2019-12-07 12:42:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 12:42:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 207. [2019-12-07 12:42:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-07 12:42:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 266 transitions. [2019-12-07 12:42:05,738 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 266 transitions. Word has length 30 [2019-12-07 12:42:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,738 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 266 transitions. [2019-12-07 12:42:05,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2019-12-07 12:42:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 12:42:05,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,739 INFO L410 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] [2019-12-07 12:42:05,740 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash 542399705, now seen corresponding path program 1 times [2019-12-07 12:42:05,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929361886] [2019-12-07 12:42:05,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:42:05,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929361886] [2019-12-07 12:42:05,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:42:05,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750698322] [2019-12-07 12:42:05,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:05,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:05,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:05,774 INFO L87 Difference]: Start difference. First operand 207 states and 266 transitions. Second operand 4 states. [2019-12-07 12:42:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,806 INFO L93 Difference]: Finished difference Result 517 states and 673 transitions. [2019-12-07 12:42:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:05,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 12:42:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,808 INFO L225 Difference]: With dead ends: 517 [2019-12-07 12:42:05,808 INFO L226 Difference]: Without dead ends: 342 [2019-12-07 12:42:05,809 INFO L630 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 [2019-12-07 12:42:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-07 12:42:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 207. [2019-12-07 12:42:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-07 12:42:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 265 transitions. [2019-12-07 12:42:05,816 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 265 transitions. Word has length 40 [2019-12-07 12:42:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,817 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 265 transitions. [2019-12-07 12:42:05,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 265 transitions. [2019-12-07 12:42:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:42:05,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,817 INFO L410 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] [2019-12-07 12:42:05,818 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,818 INFO L82 PathProgramCache]: Analyzing trace with hash 149186591, now seen corresponding path program 1 times [2019-12-07 12:42:05,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749498482] [2019-12-07 12:42:05,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:05,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749498482] [2019-12-07 12:42:05,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:05,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024790183] [2019-12-07 12:42:05,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,849 INFO L87 Difference]: Start difference. First operand 207 states and 265 transitions. Second operand 3 states. [2019-12-07 12:42:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,881 INFO L93 Difference]: Finished difference Result 421 states and 564 transitions. [2019-12-07 12:42:05,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 12:42:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,883 INFO L225 Difference]: With dead ends: 421 [2019-12-07 12:42:05,883 INFO L226 Difference]: Without dead ends: 249 [2019-12-07 12:42:05,884 INFO L630 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 [2019-12-07 12:42:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-12-07 12:42:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 167. [2019-12-07 12:42:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-12-07 12:42:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 215 transitions. [2019-12-07 12:42:05,890 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 215 transitions. Word has length 42 [2019-12-07 12:42:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,891 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 215 transitions. [2019-12-07 12:42:05,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 215 transitions. [2019-12-07 12:42:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 12:42:05,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,892 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,892 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1740967174, now seen corresponding path program 1 times [2019-12-07 12:42:05,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547321197] [2019-12-07 12:42:05,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:05,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547321197] [2019-12-07 12:42:05,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:05,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522749497] [2019-12-07 12:42:05,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,920 INFO L87 Difference]: Start difference. First operand 167 states and 215 transitions. Second operand 3 states. [2019-12-07 12:42:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,937 INFO L93 Difference]: Finished difference Result 275 states and 362 transitions. [2019-12-07 12:42:05,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-07 12:42:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,938 INFO L225 Difference]: With dead ends: 275 [2019-12-07 12:42:05,938 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 12:42:05,939 INFO L630 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 [2019-12-07 12:42:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 12:42:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-12-07 12:42:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 12:42:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2019-12-07 12:42:05,942 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 47 [2019-12-07 12:42:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,942 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2019-12-07 12:42:05,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2019-12-07 12:42:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 12:42:05,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,943 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,943 INFO L82 PathProgramCache]: Analyzing trace with hash 845016213, now seen corresponding path program 1 times [2019-12-07 12:42:05,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991546106] [2019-12-07 12:42:05,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:05,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991546106] [2019-12-07 12:42:05,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:05,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:05,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151921473] [2019-12-07 12:42:05,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:05,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:05,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:05,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:05,969 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand 3 states. [2019-12-07 12:42:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:05,988 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2019-12-07 12:42:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:05,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 12:42:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:05,990 INFO L225 Difference]: With dead ends: 313 [2019-12-07 12:42:05,990 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 12:42:05,990 INFO L630 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 [2019-12-07 12:42:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 12:42:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 138. [2019-12-07 12:42:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-12-07 12:42:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 173 transitions. [2019-12-07 12:42:05,994 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 173 transitions. Word has length 50 [2019-12-07 12:42:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:05,994 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 173 transitions. [2019-12-07 12:42:05,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2019-12-07 12:42:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:42:05,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:05,995 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:05,995 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:05,996 INFO L82 PathProgramCache]: Analyzing trace with hash -128059535, now seen corresponding path program 1 times [2019-12-07 12:42:05,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:05,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856653293] [2019-12-07 12:42:05,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:06,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856653293] [2019-12-07 12:42:06,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:06,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:06,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930517138] [2019-12-07 12:42:06,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:06,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:06,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:06,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:06,032 INFO L87 Difference]: Start difference. First operand 138 states and 173 transitions. Second operand 3 states. [2019-12-07 12:42:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:06,050 INFO L93 Difference]: Finished difference Result 303 states and 391 transitions. [2019-12-07 12:42:06,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:06,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 12:42:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:06,051 INFO L225 Difference]: With dead ends: 303 [2019-12-07 12:42:06,051 INFO L226 Difference]: Without dead ends: 211 [2019-12-07 12:42:06,052 INFO L630 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 [2019-12-07 12:42:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-12-07 12:42:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 134. [2019-12-07 12:42:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 12:42:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2019-12-07 12:42:06,056 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 52 [2019-12-07 12:42:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:06,056 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2019-12-07 12:42:06,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2019-12-07 12:42:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:42:06,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:06,057 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:06,057 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:06,057 INFO L82 PathProgramCache]: Analyzing trace with hash 586946759, now seen corresponding path program 1 times [2019-12-07 12:42:06,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:06,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140588453] [2019-12-07 12:42:06,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:06,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140588453] [2019-12-07 12:42:06,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:06,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:06,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407462392] [2019-12-07 12:42:06,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:06,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:06,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:06,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:06,088 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand 3 states. [2019-12-07 12:42:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:06,101 INFO L93 Difference]: Finished difference Result 220 states and 279 transitions. [2019-12-07 12:42:06,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:06,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 12:42:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:06,102 INFO L225 Difference]: With dead ends: 220 [2019-12-07 12:42:06,102 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 12:42:06,102 INFO L630 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 [2019-12-07 12:42:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 12:42:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-12-07 12:42:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 12:42:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2019-12-07 12:42:06,106 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 55 [2019-12-07 12:42:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:06,106 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2019-12-07 12:42:06,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2019-12-07 12:42:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:42:06,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:06,107 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:06,107 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:06,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1037403053, now seen corresponding path program 1 times [2019-12-07 12:42:06,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:06,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078284158] [2019-12-07 12:42:06,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:06,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078284158] [2019-12-07 12:42:06,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:06,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:06,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570840269] [2019-12-07 12:42:06,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:06,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:06,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:06,141 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand 3 states. [2019-12-07 12:42:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:06,146 INFO L93 Difference]: Finished difference Result 233 states and 292 transitions. [2019-12-07 12:42:06,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:06,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 12:42:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:06,147 INFO L225 Difference]: With dead ends: 233 [2019-12-07 12:42:06,147 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 12:42:06,148 INFO L630 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 [2019-12-07 12:42:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 12:42:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2019-12-07 12:42:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 12:42:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2019-12-07 12:42:06,152 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 59 [2019-12-07 12:42:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:06,152 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2019-12-07 12:42:06,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2019-12-07 12:42:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:42:06,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:06,153 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:06,153 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:06,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1109283371, now seen corresponding path program 1 times [2019-12-07 12:42:06,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:06,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762306143] [2019-12-07 12:42:06,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:06,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762306143] [2019-12-07 12:42:06,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:06,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:42:06,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419732566] [2019-12-07 12:42:06,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:06,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:06,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:06,187 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand 4 states. [2019-12-07 12:42:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:06,212 INFO L93 Difference]: Finished difference Result 212 states and 263 transitions. [2019-12-07 12:42:06,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:06,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 12:42:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:06,213 INFO L225 Difference]: With dead ends: 212 [2019-12-07 12:42:06,213 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 12:42:06,214 INFO L630 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 [2019-12-07 12:42:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 12:42:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-07 12:42:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 12:42:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2019-12-07 12:42:06,217 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 62 [2019-12-07 12:42:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:06,218 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2019-12-07 12:42:06,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2019-12-07 12:42:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 12:42:06,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:06,218 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:06,218 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1320441434, now seen corresponding path program 1 times [2019-12-07 12:42:06,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:06,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261117443] [2019-12-07 12:42:06,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:42:06,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261117443] [2019-12-07 12:42:06,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:06,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:42:06,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951247064] [2019-12-07 12:42:06,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:06,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:06,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:06,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:06,279 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 4 states. [2019-12-07 12:42:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:06,337 INFO L93 Difference]: Finished difference Result 291 states and 356 transitions. [2019-12-07 12:42:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:06,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-07 12:42:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:06,338 INFO L225 Difference]: With dead ends: 291 [2019-12-07 12:42:06,338 INFO L226 Difference]: Without dead ends: 209 [2019-12-07 12:42:06,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:42:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-07 12:42:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 161. [2019-12-07 12:42:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 12:42:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2019-12-07 12:42:06,345 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 64 [2019-12-07 12:42:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:06,345 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2019-12-07 12:42:06,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2019-12-07 12:42:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 12:42:06,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:06,346 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:06,346 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1208534794, now seen corresponding path program 1 times [2019-12-07 12:42:06,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:06,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017435859] [2019-12-07 12:42:06,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:42:06,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017435859] [2019-12-07 12:42:06,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:06,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:42:06,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563325082] [2019-12-07 12:42:06,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:06,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:06,406 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 4 states. [2019-12-07 12:42:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:06,446 INFO L93 Difference]: Finished difference Result 270 states and 326 transitions. [2019-12-07 12:42:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:06,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 12:42:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:06,448 INFO L225 Difference]: With dead ends: 270 [2019-12-07 12:42:06,448 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 12:42:06,449 INFO L630 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 [2019-12-07 12:42:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 12:42:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 163. [2019-12-07 12:42:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:42:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2019-12-07 12:42:06,459 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 75 [2019-12-07 12:42:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:06,459 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2019-12-07 12:42:06,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2019-12-07 12:42:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 12:42:06,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:06,460 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:06,461 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:06,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:06,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1220807128, now seen corresponding path program 1 times [2019-12-07 12:42:06,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:06,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004406214] [2019-12-07 12:42:06,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:42:06,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004406214] [2019-12-07 12:42:06,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125434798] [2019-12-07 12:42:06,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:06,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:06,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:06,743 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:42:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:06,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2052225276] [2019-12-07 12:42:06,795 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2019-12-07 12:42:06,795 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:42:06,799 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:42:06,803 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:42:06,804 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:42:10,838 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:42:11,293 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 12:42:11,730 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 12:42:12,150 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-12-07 12:42:12,386 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 12:42:12,795 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 12:42:13,079 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 12:42:13,427 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 12:42:13,791 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 12:42:14,421 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 12:42:15,149 WARN L192 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 12:42:15,472 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 12:42:15,735 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 12:42:16,098 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 12:42:16,373 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 12:42:16,677 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 12:42:17,051 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 12:42:17,439 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 12:42:18,031 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 12:42:18,629 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 12:42:18,954 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2019-12-07 12:42:19,323 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 12:42:19,983 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 12:42:20,321 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 12:42:20,687 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 12:42:21,076 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 12:42:21,503 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 12:42:22,126 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 121 [2019-12-07 12:42:22,785 WARN L192 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 122 [2019-12-07 12:42:23,191 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 12:42:23,785 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2019-12-07 12:42:24,196 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 12:42:24,620 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 12:42:25,074 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 12:42:25,745 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 119 [2019-12-07 12:42:26,440 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 123 [2019-12-07 12:42:26,990 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 110 [2019-12-07 12:42:27,547 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 119 [2019-12-07 12:42:28,147 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 121 [2019-12-07 12:42:29,079 WARN L192 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 146 [2019-12-07 12:42:30,435 WARN L192 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 160 [2019-12-07 12:42:30,939 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-12-07 12:42:32,064 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 140 [2019-12-07 12:42:32,503 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-07 12:42:32,813 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-07 12:42:33,092 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-07 12:42:33,365 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-07 12:42:33,639 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-12-07 12:42:33,971 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-12-07 12:42:34,339 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2019-12-07 12:42:34,651 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-12-07 12:42:34,998 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 77 [2019-12-07 12:42:35,356 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 83 [2019-12-07 12:42:35,704 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2019-12-07 12:42:36,085 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 84 [2019-12-07 12:42:36,488 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 86 [2019-12-07 12:42:36,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:42:36,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [12, 3, 3] total 73 [2019-12-07 12:42:36,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692326151] [2019-12-07 12:42:36,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-12-07 12:42:36,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:36,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-12-07 12:42:36,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=4865, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 12:42:36,492 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand 60 states. [2019-12-07 12:42:36,998 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2019-12-07 12:42:37,325 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2019-12-07 12:42:38,137 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2019-12-07 12:42:38,425 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2019-12-07 12:42:38,799 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2019-12-07 12:42:39,082 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2019-12-07 12:42:39,463 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 86 [2019-12-07 12:42:39,872 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 89 [2019-12-07 12:42:40,263 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2019-12-07 12:42:40,496 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-12-07 12:42:40,796 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-12-07 12:42:41,030 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-12-07 12:42:41,273 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-12-07 12:42:41,721 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-12-07 12:42:42,144 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 [2019-12-07 12:42:42,424 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-12-07 12:42:42,828 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 100 [2019-12-07 12:42:43,214 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-12-07 12:42:43,789 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-12-07 12:42:44,121 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-12-07 12:42:44,600 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-12-07 12:42:44,951 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 [2019-12-07 12:42:45,240 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-12-07 12:42:45,567 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2019-12-07 12:42:45,949 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-12-07 12:42:46,243 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2019-12-07 12:42:46,642 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 107 [2019-12-07 12:42:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:50,262 INFO L93 Difference]: Finished difference Result 397 states and 475 transitions. [2019-12-07 12:42:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-07 12:42:50,263 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 76 [2019-12-07 12:42:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:50,264 INFO L225 Difference]: With dead ends: 397 [2019-12-07 12:42:50,264 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 12:42:50,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3535 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=716, Invalid=9384, Unknown=0, NotChecked=0, Total=10100 [2019-12-07 12:42:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 12:42:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 173. [2019-12-07 12:42:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:42:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-12-07 12:42:50,286 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 76 [2019-12-07 12:42:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:50,286 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-12-07 12:42:50,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-12-07 12:42:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-12-07 12:42:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 12:42:50,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:50,287 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:50,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:50,488 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:50,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1596267019, now seen corresponding path program 1 times [2019-12-07 12:42:50,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:50,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755519906] [2019-12-07 12:42:50,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:42:50,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755519906] [2019-12-07 12:42:50,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675194215] [2019-12-07 12:42:50,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:50,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:50,714 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:42:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:42:50,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [429257835] [2019-12-07 12:42:50,744 INFO L159 IcfgInterpreter]: Started Sifa with 77 locations of interest [2019-12-07 12:42:50,745 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:42:50,745 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:42:50,745 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:42:50,745 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:42:53,881 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:42:54,229 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 102 [2019-12-07 12:42:54,646 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 12:42:55,079 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 12:42:55,492 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-12-07 12:42:55,738 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 12:42:55,997 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 12:42:56,270 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 12:42:56,661 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 12:42:57,047 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 12:42:57,864 WARN L192 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 12:42:58,707 WARN L192 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 12:42:59,101 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 12:42:59,502 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 12:43:00,027 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 12:43:00,321 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 12:43:00,627 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 12:43:01,071 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 12:43:01,559 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 12:43:02,271 WARN L192 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 12:43:02,893 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 12:43:03,205 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-12-07 12:43:03,674 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 12:43:04,260 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 12:43:04,620 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 12:43:04,983 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 12:43:05,399 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 12:43:05,853 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 12:43:06,652 WARN L192 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 121 [2019-12-07 12:43:07,282 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 122 [2019-12-07 12:43:07,620 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 12:43:08,313 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2019-12-07 12:43:08,723 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 12:43:09,136 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 12:43:09,565 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 12:43:10,224 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 119 [2019-12-07 12:43:10,914 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 123 [2019-12-07 12:43:11,462 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 110 [2019-12-07 12:43:12,026 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 119 [2019-12-07 12:43:12,622 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2019-12-07 12:43:13,574 WARN L192 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 146 [2019-12-07 12:43:14,622 WARN L192 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 148 [2019-12-07 12:43:14,962 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-12-07 12:43:15,824 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 140 [2019-12-07 12:43:16,802 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-07 12:43:17,273 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-07 12:43:17,760 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-07 12:43:18,068 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-12-07 12:43:18,562 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-12-07 12:43:19,381 WARN L192 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-12-07 12:43:20,255 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-12-07 12:43:20,557 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-12-07 12:43:20,910 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 75 [2019-12-07 12:43:21,431 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 82 [2019-12-07 12:43:21,886 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2019-12-07 12:43:22,284 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2019-12-07 12:43:22,690 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 88 [2019-12-07 12:43:23,071 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2019-12-07 12:43:23,461 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 12:43:23,864 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 12:43:24,307 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 93 [2019-12-07 12:43:24,360 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:43:24,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:24,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 3, 3] total 15 [2019-12-07 12:43:24,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787320847] [2019-12-07 12:43:24,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:43:24,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:43:24,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=5582, Unknown=0, NotChecked=0, Total=6006 [2019-12-07 12:43:24,363 INFO L87 Difference]: Start difference. First operand 173 states and 205 transitions. Second operand 15 states. [2019-12-07 12:43:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:25,547 INFO L93 Difference]: Finished difference Result 552 states and 655 transitions. [2019-12-07 12:43:25,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 12:43:25,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2019-12-07 12:43:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:25,549 INFO L225 Difference]: With dead ends: 552 [2019-12-07 12:43:25,549 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 12:43:25,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4294 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=711, Invalid=10631, Unknown=0, NotChecked=0, Total=11342 [2019-12-07 12:43:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 12:43:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 266. [2019-12-07 12:43:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 12:43:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 302 transitions. [2019-12-07 12:43:25,578 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 302 transitions. Word has length 80 [2019-12-07 12:43:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:25,579 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 302 transitions. [2019-12-07 12:43:25,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:43:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 302 transitions. [2019-12-07 12:43:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 12:43:25,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:25,580 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:25,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:25,781 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2007718696, now seen corresponding path program 1 times [2019-12-07 12:43:25,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:25,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169518721] [2019-12-07 12:43:25,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-12-07 12:43:26,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169518721] [2019-12-07 12:43:26,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:26,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 12:43:26,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060012958] [2019-12-07 12:43:26,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:43:26,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:26,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:43:26,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:43:26,006 INFO L87 Difference]: Start difference. First operand 266 states and 302 transitions. Second operand 14 states. [2019-12-07 12:43:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:27,887 INFO L93 Difference]: Finished difference Result 538 states and 632 transitions. [2019-12-07 12:43:27,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 12:43:27,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2019-12-07 12:43:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:27,893 INFO L225 Difference]: With dead ends: 538 [2019-12-07 12:43:27,893 INFO L226 Difference]: Without dead ends: 422 [2019-12-07 12:43:27,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:43:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-07 12:43:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 290. [2019-12-07 12:43:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-07 12:43:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 330 transitions. [2019-12-07 12:43:27,936 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 330 transitions. Word has length 149 [2019-12-07 12:43:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:27,936 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 330 transitions. [2019-12-07 12:43:27,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:43:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 330 transitions. [2019-12-07 12:43:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 12:43:27,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:27,937 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:27,938 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1774911454, now seen corresponding path program 1 times [2019-12-07 12:43:27,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:27,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596581739] [2019-12-07 12:43:27,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-12-07 12:43:28,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596581739] [2019-12-07 12:43:28,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:28,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:43:28,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586866779] [2019-12-07 12:43:28,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:43:28,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:43:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:43:28,057 INFO L87 Difference]: Start difference. First operand 290 states and 330 transitions. Second operand 10 states. [2019-12-07 12:43:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:29,642 INFO L93 Difference]: Finished difference Result 745 states and 882 transitions. [2019-12-07 12:43:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 12:43:29,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2019-12-07 12:43:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:29,646 INFO L225 Difference]: With dead ends: 745 [2019-12-07 12:43:29,646 INFO L226 Difference]: Without dead ends: 605 [2019-12-07 12:43:29,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 12:43:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-12-07 12:43:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 339. [2019-12-07 12:43:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-07 12:43:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 392 transitions. [2019-12-07 12:43:29,679 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 392 transitions. Word has length 149 [2019-12-07 12:43:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:29,680 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 392 transitions. [2019-12-07 12:43:29,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:43:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 392 transitions. [2019-12-07 12:43:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 12:43:29,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:29,681 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:29,681 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1559412806, now seen corresponding path program 1 times [2019-12-07 12:43:29,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:29,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683161530] [2019-12-07 12:43:29,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 12:43:29,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683161530] [2019-12-07 12:43:29,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:29,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:43:29,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837290326] [2019-12-07 12:43:29,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:43:29,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:29,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:43:29,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:29,732 INFO L87 Difference]: Start difference. First operand 339 states and 392 transitions. Second operand 4 states. [2019-12-07 12:43:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:29,831 INFO L93 Difference]: Finished difference Result 604 states and 716 transitions. [2019-12-07 12:43:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:43:29,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 12:43:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:29,833 INFO L225 Difference]: With dead ends: 604 [2019-12-07 12:43:29,833 INFO L226 Difference]: Without dead ends: 415 [2019-12-07 12:43:29,834 INFO L630 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 [2019-12-07 12:43:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-12-07 12:43:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 290. [2019-12-07 12:43:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-07 12:43:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 326 transitions. [2019-12-07 12:43:29,854 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 326 transitions. Word has length 158 [2019-12-07 12:43:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:29,854 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 326 transitions. [2019-12-07 12:43:29,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:43:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 326 transitions. [2019-12-07 12:43:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 12:43:29,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:29,855 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:29,855 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:29,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1492457158, now seen corresponding path program 1 times [2019-12-07 12:43:29,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:29,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914601792] [2019-12-07 12:43:29,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 12:43:29,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914601792] [2019-12-07 12:43:29,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:29,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:43:29,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817588745] [2019-12-07 12:43:29,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:43:29,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:29,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:43:29,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:43:29,955 INFO L87 Difference]: Start difference. First operand 290 states and 326 transitions. Second operand 9 states. [2019-12-07 12:43:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:30,387 INFO L93 Difference]: Finished difference Result 605 states and 706 transitions. [2019-12-07 12:43:30,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 12:43:30,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 171 [2019-12-07 12:43:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:30,389 INFO L225 Difference]: With dead ends: 605 [2019-12-07 12:43:30,389 INFO L226 Difference]: Without dead ends: 469 [2019-12-07 12:43:30,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2019-12-07 12:43:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-12-07 12:43:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 298. [2019-12-07 12:43:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 12:43:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 336 transitions. [2019-12-07 12:43:30,420 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 336 transitions. Word has length 171 [2019-12-07 12:43:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:30,420 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 336 transitions. [2019-12-07 12:43:30,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:43:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 336 transitions. [2019-12-07 12:43:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-07 12:43:30,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:30,422 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:30,422 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:30,422 INFO L82 PathProgramCache]: Analyzing trace with hash 536153941, now seen corresponding path program 1 times [2019-12-07 12:43:30,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:30,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822454852] [2019-12-07 12:43:30,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 12:43:31,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822454852] [2019-12-07 12:43:31,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347678462] [2019-12-07 12:43:31,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:31,279 INFO L264 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 12:43:31,283 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 12:43:31,482 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 12:43:31,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [259333140] [2019-12-07 12:43:31,780 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2019-12-07 12:43:31,780 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:31,781 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:43:31,781 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:43:31,781 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:43:36,424 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:43:36,706 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-12-07 12:43:37,234 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 12:43:37,768 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 12:43:38,285 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-12-07 12:43:38,582 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 12:43:38,893 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 12:43:39,248 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 12:43:39,696 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 12:43:40,175 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 12:43:40,866 WARN L192 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 12:43:41,560 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 12:43:41,884 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 12:43:42,463 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 12:43:43,085 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 12:43:43,421 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 12:43:43,784 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 12:43:45,021 WARN L192 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 12:43:45,477 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 12:43:46,592 WARN L192 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 12:43:47,495 WARN L192 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 12:43:47,838 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-12-07 12:43:48,434 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 12:43:49,399 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 12:43:49,814 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 12:43:50,372 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 12:43:52,830 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 12:43:53,310 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 12:43:54,011 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 121 [2019-12-07 12:43:54,737 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 122 [2019-12-07 12:43:55,132 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 12:43:55,941 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2019-12-07 12:43:56,850 WARN L192 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 12:43:57,892 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 12:43:58,791 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 12:44:00,172 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 119 [2019-12-07 12:44:00,992 WARN L192 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 123 [2019-12-07 12:44:01,485 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-07 12:44:04,459 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-12-07 12:44:05,489 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 12:44:05,760 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-12-07 12:44:07,563 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-07 12:44:08,232 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-12-07 12:44:08,969 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-12-07 12:44:10,756 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-07 12:44:11,277 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-12-07 12:44:11,823 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-12-07 12:44:12,351 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-12-07 12:44:12,879 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-07 12:44:13,136 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:44:13,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:44:13,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 12] total 35 [2019-12-07 12:44:13,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448418396] [2019-12-07 12:44:13,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 12:44:13,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 12:44:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=10050, Unknown=0, NotChecked=0, Total=10712 [2019-12-07 12:44:13,139 INFO L87 Difference]: Start difference. First operand 298 states and 336 transitions. Second operand 36 states. [2019-12-07 12:44:19,701 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 12:44:20,237 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 12:44:24,422 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 12:44:25,324 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 12:44:25,690 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 12:44:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:27,996 INFO L93 Difference]: Finished difference Result 844 states and 978 transitions. [2019-12-07 12:44:27,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-12-07 12:44:27,996 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-12-07 12:44:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:27,998 INFO L225 Difference]: With dead ends: 844 [2019-12-07 12:44:27,998 INFO L226 Difference]: Without dead ends: 692 [2019-12-07 12:44:28,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 417 SyntacticMatches, 22 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21571 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=3756, Invalid=54084, Unknown=0, NotChecked=0, Total=57840 [2019-12-07 12:44:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-07 12:44:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 287. [2019-12-07 12:44:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-12-07 12:44:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 320 transitions. [2019-12-07 12:44:28,030 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 320 transitions. Word has length 174 [2019-12-07 12:44:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:28,030 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 320 transitions. [2019-12-07 12:44:28,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 12:44:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 320 transitions. [2019-12-07 12:44:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 12:44:28,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:28,031 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:28,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:44:28,232 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:28,233 INFO L82 PathProgramCache]: Analyzing trace with hash 918317815, now seen corresponding path program 1 times [2019-12-07 12:44:28,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:28,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982867283] [2019-12-07 12:44:28,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 12:44:28,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982867283] [2019-12-07 12:44:28,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313421369] [2019-12-07 12:44:28,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:44:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:28,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 12:44:28,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:44:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 12:44:29,409 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:44:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-12-07 12:44:29,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1149344894] [2019-12-07 12:44:29,904 INFO L159 IcfgInterpreter]: Started Sifa with 86 locations of interest [2019-12-07 12:44:29,904 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:44:29,905 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:44:29,905 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:44:29,905 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:44:31,869 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 21952 conjuctions. This might take some time... [2019-12-07 12:46:10,749 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 21952 conjuctions. This might take some time... [2019-12-07 12:48:17,429 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:48:17,712 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2019-12-07 12:48:18,254 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 12:48:18,833 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 12:48:19,343 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-12-07 12:48:19,721 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 12:48:20,029 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 12:48:20,339 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 12:48:20,943 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 12:48:21,519 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 12:48:22,180 WARN L192 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 12:48:23,191 WARN L192 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 12:48:23,548 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 12:48:23,857 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 12:48:24,323 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 12:48:25,021 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 12:48:25,857 WARN L192 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 12:48:26,962 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 12:48:27,451 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 12:48:28,400 WARN L192 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 12:48:29,142 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 12:48:29,542 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-12-07 12:48:30,364 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 12:48:31,254 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 12:48:31,839 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 12:48:32,287 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 12:48:33,905 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 12:48:34,393 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 12:48:35,422 WARN L192 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 125 [2019-12-07 12:48:36,500 WARN L192 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 127 [2019-12-07 12:48:37,068 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2019-12-07 12:48:38,612 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 99 [2019-12-07 12:48:39,115 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 12:48:39,867 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 12:48:40,406 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 12:48:42,141 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 124 [2019-12-07 12:48:42,945 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 128 [2019-12-07 12:48:43,598 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-12-07 12:48:47,363 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-12-07 12:48:48,376 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-07 12:48:49,095 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-12-07 12:48:49,637 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-12-07 12:48:50,583 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-12-07 12:48:51,222 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-07 12:48:51,749 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-07 12:48:53,667 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:48:53,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:48:53,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 15] total 49 [2019-12-07 12:48:53,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574566108] [2019-12-07 12:48:53,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 12:48:53,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:48:53,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 12:48:53,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=13739, Unknown=0, NotChecked=0, Total=14520 [2019-12-07 12:48:53,670 INFO L87 Difference]: Start difference. First operand 287 states and 320 transitions. Second operand 49 states. [2019-12-07 12:48:57,834 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 12:48:58,590 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 12:48:59,163 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 12:48:59,464 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 12:49:04,733 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 12:49:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:49:06,155 INFO L93 Difference]: Finished difference Result 639 states and 733 transitions. [2019-12-07 12:49:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 12:49:06,157 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 178 [2019-12-07 12:49:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:49:06,160 INFO L225 Difference]: With dead ends: 639 [2019-12-07 12:49:06,160 INFO L226 Difference]: Without dead ends: 498 [2019-12-07 12:49:06,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 413 SyntacticMatches, 21 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13019 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=2133, Invalid=34539, Unknown=0, NotChecked=0, Total=36672 [2019-12-07 12:49:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-12-07 12:49:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 287. [2019-12-07 12:49:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-12-07 12:49:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2019-12-07 12:49:06,198 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 178 [2019-12-07 12:49:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:49:06,198 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2019-12-07 12:49:06,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 12:49:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2019-12-07 12:49:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 12:49:06,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:49:06,199 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:49:06,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:49:06,401 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:49:06,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:49:06,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1508336166, now seen corresponding path program 1 times [2019-12-07 12:49:06,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:49:06,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202949201] [2019-12-07 12:49:06,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:49:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:49:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 12:49:06,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202949201] [2019-12-07 12:49:06,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:49:06,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:49:06,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198427257] [2019-12-07 12:49:06,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:49:06,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:49:06,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:49:06,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:49:06,555 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand 10 states. [2019-12-07 12:49:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:49:07,298 INFO L93 Difference]: Finished difference Result 555 states and 632 transitions. [2019-12-07 12:49:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:49:07,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2019-12-07 12:49:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:49:07,303 INFO L225 Difference]: With dead ends: 555 [2019-12-07 12:49:07,303 INFO L226 Difference]: Without dead ends: 422 [2019-12-07 12:49:07,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:49:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-07 12:49:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 288. [2019-12-07 12:49:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 12:49:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 319 transitions. [2019-12-07 12:49:07,345 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 319 transitions. Word has length 186 [2019-12-07 12:49:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:49:07,345 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 319 transitions. [2019-12-07 12:49:07,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:49:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 319 transitions. [2019-12-07 12:49:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 12:49:07,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:49:07,346 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:49:07,346 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:49:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:49:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2020673312, now seen corresponding path program 1 times [2019-12-07 12:49:07,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:49:07,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619931765] [2019-12-07 12:49:07,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:49:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:49:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 12:49:07,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619931765] [2019-12-07 12:49:07,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:49:07,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:49:07,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265774592] [2019-12-07 12:49:07,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:49:07,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:49:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:49:07,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:49:07,434 INFO L87 Difference]: Start difference. First operand 288 states and 319 transitions. Second operand 8 states. [2019-12-07 12:49:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:49:07,607 INFO L93 Difference]: Finished difference Result 508 states and 575 transitions. [2019-12-07 12:49:07,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:49:07,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 186 [2019-12-07 12:49:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:49:07,609 INFO L225 Difference]: With dead ends: 508 [2019-12-07 12:49:07,609 INFO L226 Difference]: Without dead ends: 374 [2019-12-07 12:49:07,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:49:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-07 12:49:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2019-12-07 12:49:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-07 12:49:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 368 transitions. [2019-12-07 12:49:07,642 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 368 transitions. Word has length 186 [2019-12-07 12:49:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:49:07,642 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 368 transitions. [2019-12-07 12:49:07,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:49:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 368 transitions. [2019-12-07 12:49:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 12:49:07,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:49:07,643 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:49:07,643 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:49:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:49:07,643 INFO L82 PathProgramCache]: Analyzing trace with hash -719443294, now seen corresponding path program 1 times [2019-12-07 12:49:07,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:49:07,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035065502] [2019-12-07 12:49:07,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:49:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:49:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 12:49:07,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035065502] [2019-12-07 12:49:07,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:49:07,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:49:07,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69477785] [2019-12-07 12:49:07,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:49:07,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:49:07,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:49:07,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:49:07,748 INFO L87 Difference]: Start difference. First operand 328 states and 368 transitions. Second operand 11 states. [2019-12-07 12:49:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:49:08,057 INFO L93 Difference]: Finished difference Result 551 states and 627 transitions. [2019-12-07 12:49:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:49:08,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-12-07 12:49:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:49:08,059 INFO L225 Difference]: With dead ends: 551 [2019-12-07 12:49:08,059 INFO L226 Difference]: Without dead ends: 377 [2019-12-07 12:49:08,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:49:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-12-07 12:49:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 325. [2019-12-07 12:49:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-07 12:49:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 363 transitions. [2019-12-07 12:49:08,097 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 363 transitions. Word has length 187 [2019-12-07 12:49:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:49:08,097 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 363 transitions. [2019-12-07 12:49:08,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:49:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 363 transitions. [2019-12-07 12:49:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 12:49:08,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:49:08,098 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:49:08,099 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:49:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:49:08,099 INFO L82 PathProgramCache]: Analyzing trace with hash 931647391, now seen corresponding path program 1 times [2019-12-07 12:49:08,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:49:08,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836422676] [2019-12-07 12:49:08,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:49:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:49:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-12-07 12:49:08,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836422676] [2019-12-07 12:49:08,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885652574] [2019-12-07 12:49:08,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:49:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:49:08,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 12:49:08,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:49:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 12:49:08,683 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:49:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 12:49:09,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581883364] [2019-12-07 12:49:09,063 INFO L159 IcfgInterpreter]: Started Sifa with 96 locations of interest [2019-12-07 12:49:09,063 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:49:09,064 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:49:09,064 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:49:09,064 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:49:13,941 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:49:14,170 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-12-07 12:49:14,644 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 12:49:15,524 WARN L192 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 12:49:16,735 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 144 DAG size of output: 122 [2019-12-07 12:49:17,083 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 12:49:17,752 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 12:49:18,373 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 12:49:18,803 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 12:49:19,336 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 12:49:19,963 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 12:49:20,676 WARN L192 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 12:49:21,016 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 12:49:21,482 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 12:49:22,508 WARN L192 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 12:49:23,074 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 12:49:23,394 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 12:49:24,375 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 12:49:24,928 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 12:49:25,535 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 12:49:26,140 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 12:49:26,459 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-12-07 12:49:26,886 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 12:49:27,739 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 12:49:28,127 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 12:49:28,518 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 12:49:30,344 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 12:49:30,832 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 12:49:31,587 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 121 [2019-12-07 12:49:32,442 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 122 [2019-12-07 12:49:33,047 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 12:49:33,766 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2019-12-07 12:49:34,437 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 12:49:34,952 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 12:49:35,439 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 12:49:36,772 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 119 [2019-12-07 12:49:37,555 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 123 [2019-12-07 12:49:38,078 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-12-07 12:49:41,397 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-12-07 12:49:42,668 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-12-07 12:49:45,329 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-12-07 12:49:45,799 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-12-07 12:49:49,597 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-12-07 12:49:49,914 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-12-07 12:49:49,915 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:49:49,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:49:49,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 16] total 36 [2019-12-07 12:49:49,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948589706] [2019-12-07 12:49:49,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 12:49:49,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:49:49,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 12:49:49,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=12000, Unknown=0, NotChecked=0, Total=12656 [2019-12-07 12:49:49,917 INFO L87 Difference]: Start difference. First operand 325 states and 363 transitions. Second operand 36 states. [2019-12-07 12:49:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:49:51,329 INFO L93 Difference]: Finished difference Result 642 states and 731 transitions. [2019-12-07 12:49:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 12:49:51,330 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 188 [2019-12-07 12:49:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:49:51,333 INFO L225 Difference]: With dead ends: 642 [2019-12-07 12:49:51,333 INFO L226 Difference]: Without dead ends: 463 [2019-12-07 12:49:51,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 436 SyntacticMatches, 29 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8363 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=963, Invalid=17127, Unknown=0, NotChecked=0, Total=18090 [2019-12-07 12:49:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-12-07 12:49:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 325. [2019-12-07 12:49:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-07 12:49:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 362 transitions. [2019-12-07 12:49:51,376 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 362 transitions. Word has length 188 [2019-12-07 12:49:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:49:51,376 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 362 transitions. [2019-12-07 12:49:51,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 12:49:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 362 transitions. [2019-12-07 12:49:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-07 12:49:51,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:49:51,377 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:49:51,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:49:51,578 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:49:51,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:49:51,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1756695346, now seen corresponding path program 1 times [2019-12-07 12:49:51,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:49:51,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383172780] [2019-12-07 12:49:51,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:49:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:49:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:49:51,840 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:49:51,841 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:49:51,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:49:51 BoogieIcfgContainer [2019-12-07 12:49:51,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:49:51,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:49:51,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:49:51,973 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:49:51,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:04" (3/4) ... [2019-12-07 12:49:51,975 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:49:52,100 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_99866362-a10f-4dcd-9f41-563e5d774f52/bin/utaipan/witness.graphml [2019-12-07 12:49:52,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:49:52,101 INFO L168 Benchmark]: Toolchain (without parser) took 469451.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.2 MB in the beginning and 854.6 MB in the end (delta: 91.6 MB). Peak memory consumption was 234.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:49:52,101 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:49:52,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:49:52,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:49:52,102 INFO L168 Benchmark]: Boogie Preprocessor took 73.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:49:52,102 INFO L168 Benchmark]: RCFGBuilder took 1538.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.0 MB). Peak memory consumption was 253.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:49:52,102 INFO L168 Benchmark]: TraceAbstraction took 467374.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 32.5 MB). Free memory was 1.0 GB in the beginning and 902.4 MB in the end (delta: 121.0 MB). Peak memory consumption was 153.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:49:52,102 INFO L168 Benchmark]: Witness Printer took 127.80 ms. Allocated memory is still 1.2 GB. Free memory was 902.4 MB in the beginning and 854.6 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:49:52,103 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1538.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.0 MB). Peak memory consumption was 253.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 467374.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 32.5 MB). Free memory was 1.0 GB in the beginning and 902.4 MB in the end (delta: 121.0 MB). Peak memory consumption was 153.5 MB. Max. memory is 11.5 GB. * Witness Printer took 127.80 ms. Allocated memory is still 1.2 GB. Free memory was 902.4 MB in the beginning and 854.6 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 580]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L68] msg_t nomsg = (msg_t )-1; [L69] port_t g1v ; [L70] int8_t g1v_old ; [L71] int8_t g1v_new ; [L72] port_t g2v ; [L73] int8_t g2v_old ; [L74] int8_t g2v_new ; [L75] port_t g3v ; [L76] int8_t g3v_old ; [L77] int8_t g3v_new ; [L81] _Bool gate1Failed ; [L82] _Bool gate2Failed ; [L83] _Bool gate3Failed ; [L84] msg_t VALUE1 ; [L85] msg_t VALUE2 ; [L86] msg_t VALUE3 ; [L88] _Bool gate1Failed_History_0 ; [L89] _Bool gate1Failed_History_1 ; [L90] _Bool gate1Failed_History_2 ; [L91] _Bool gate2Failed_History_0 ; [L92] _Bool gate2Failed_History_1 ; [L93] _Bool gate2Failed_History_2 ; [L94] _Bool gate3Failed_History_0 ; [L95] _Bool gate3Failed_History_1 ; [L96] _Bool gate3Failed_History_2 ; [L97] int8_t votedValue_History_0 ; [L98] int8_t votedValue_History_1 ; [L99] int8_t votedValue_History_2 ; [L519] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] gate1Failed = __VERIFIER_nondet_bool() [L528] gate2Failed = __VERIFIER_nondet_bool() [L529] gate3Failed = __VERIFIER_nondet_bool() [L530] VALUE1 = __VERIFIER_nondet_char() [L531] VALUE2 = __VERIFIER_nondet_char() [L532] VALUE3 = __VERIFIER_nondet_char() [L533] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L534] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L535] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L536] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L537] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L538] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L539] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L540] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L541] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L542] votedValue_History_0 = __VERIFIER_nondet_char() [L543] votedValue_History_1 = __VERIFIER_nondet_char() [L544] votedValue_History_2 = __VERIFIER_nondet_char() [L248] int tmp ; [L249] int tmp___0 ; [L250] int tmp___1 ; [L251] int tmp___2 ; [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND TRUE history_id == 0 [L171] COND TRUE history_id == 0 [L172] COND TRUE historyIndex == 0 [L173] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND TRUE history_id == 0 [L171] COND TRUE history_id == 0 [L172] COND TRUE historyIndex == 0 [L173] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND TRUE history_id == 0 [L171] COND TRUE history_id == 0 [L172] COND TRUE historyIndex == 0 [L173] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND FALSE !(var < 3) [L143] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L254] tmp = add_history_type(0) [L255] COND FALSE !(! tmp) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND TRUE history_id == 1 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 [L182] COND TRUE historyIndex == 0 [L183] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND TRUE history_id == 1 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 [L182] COND TRUE historyIndex == 0 [L183] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND TRUE history_id == 1 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 [L182] COND TRUE historyIndex == 0 [L183] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND FALSE !(var < 3) [L143] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L258] tmp___0 = add_history_type(1) [L259] COND FALSE !(! tmp___0) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L129] COND TRUE history_id == 2 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 [L192] COND TRUE historyIndex == 0 [L193] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L129] COND TRUE history_id == 2 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 [L192] COND TRUE historyIndex == 0 [L193] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L129] COND TRUE history_id == 2 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 [L192] COND TRUE historyIndex == 0 [L193] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND FALSE !(var < 3) [L143] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L262] tmp___1 = add_history_type(2) [L263] COND FALSE !(! tmp___1) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L135] COND TRUE history_id == 3 [L151] COND TRUE history_id == 3 [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L135] COND TRUE history_id == 3 [L151] COND TRUE history_id == 3 [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L117] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L123] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L135] COND TRUE history_id == 3 [L151] COND TRUE history_id == 3 [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L141] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L116] COND FALSE !(var < 3) [L143] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L266] tmp___2 = add_history_type(3) [L267] COND FALSE !(! tmp___2) [L270] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L545] i2 = init() [L547] g1v_old = nomsg [L548] g1v_new = nomsg [L549] g2v_old = nomsg [L550] g2v_new = nomsg [L551] g3v_old = nomsg [L552] g3v_new = nomsg [L553] i2 = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate1Failed_History_1=13, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L554] COND TRUE 1 [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L390] COND TRUE \read(gate1Failed) [L391] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L391] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L421] COND TRUE \read(gate2Failed) [L422] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L422] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L231] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L452] COND FALSE !(\read(gate3Failed)) [L456] tmp = __VERIFIER_nondet_char() [L457] next_state = tmp [L458] COND TRUE (int )next_state == 0 [L459] tmp___0 = 1 [L470] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L470] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 [L487] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-2, votedValue_History_2=-2] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] votedValue_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L560] g1v_old = g1v_new [L561] g1v_new = nomsg [L562] g2v_old = g2v_new [L563] g2v_new = nomsg [L564] g3v_old = g3v_new [L565] g3v_new = nomsg [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; [L294] COND FALSE !(! gate1Failed) [L297] COND FALSE !(! gate2Failed) [L300] COND TRUE ! gate3Failed [L301] tmp = 1 [L171] COND TRUE history_id == 0 [L172] COND FALSE !(historyIndex == 0) [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND TRUE ! tmp___3 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 [L182] COND FALSE !(historyIndex == 0) [L185] COND TRUE historyIndex == 1 [L186] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L308] tmp___4 = read_history_bool(1, 1) [L309] COND TRUE ! tmp___4 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 [L192] COND FALSE !(historyIndex == 0) [L195] COND TRUE historyIndex == 1 [L196] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L310] tmp___5 = read_history_bool(2, 1) [L311] COND TRUE ! tmp___5 [L312] temp_count = 0 [L151] COND TRUE history_id == 3 [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L313] tmp___0 = read_history_int8(3, 0) [L314] COND TRUE (int )VALUE1 == (int )tmp___0 [L315] temp_count ++ [L151] COND TRUE history_id == 3 [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND TRUE (int )VALUE2 == (int )tmp___1 [L319] temp_count ++ [L151] COND TRUE history_id == 3 [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND TRUE (int )VALUE3 == (int )tmp___2 [L323] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L325] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L339] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 [L152] COND FALSE !(historyIndex == 0) [L155] COND TRUE historyIndex == 1 [L156] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L365] tmp___11 = read_history_int8(3, 0) [L366] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L378] return (1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L566] c1 = check() [L578] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L554] COND TRUE 1 [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L390] COND TRUE \read(gate1Failed) [L391] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L391] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L421] COND TRUE \read(gate2Failed) [L422] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L422] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L231] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L452] COND FALSE !(\read(gate3Failed)) [L456] tmp = __VERIFIER_nondet_char() [L457] next_state = tmp [L458] COND FALSE !((int )next_state == 0) [L461] COND FALSE !((int )next_state == 1) [L464] COND TRUE (int )next_state == 2 [L465] tmp___0 = 1 [L470] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L470] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=2, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 [L487] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=2, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-2] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] votedValue_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=2, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L560] g1v_old = g1v_new [L561] g1v_new = nomsg [L562] g2v_old = g2v_new [L563] g2v_new = nomsg [L564] g3v_old = g3v_new [L565] g3v_new = nomsg [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; [L294] COND FALSE !(! gate1Failed) [L297] COND FALSE !(! gate2Failed) [L300] COND TRUE ! gate3Failed [L301] tmp = 1 [L171] COND TRUE history_id == 0 [L172] COND FALSE !(historyIndex == 0) [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 [L152] COND FALSE !(historyIndex == 0) [L155] COND TRUE historyIndex == 1 [L156] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND TRUE (int )tmp___10 > -2 [L151] COND TRUE history_id == 3 [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L347] tmp___6 = read_history_int8(3, 0) [L348] COND TRUE (int )tmp___6 == (int )nomsg [L171] COND TRUE history_id == 0 [L172] COND FALSE !(historyIndex == 0) [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L349] tmp___7 = read_history_bool(0, 1) [L350] COND TRUE \read(tmp___7) [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 [L182] COND FALSE !(historyIndex == 0) [L185] COND TRUE historyIndex == 1 [L186] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L351] tmp___8 = read_history_bool(1, 1) [L352] COND TRUE \read(tmp___8) [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 [L192] COND FALSE !(historyIndex == 0) [L195] COND TRUE historyIndex == 1 [L196] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L353] tmp___9 = read_history_bool(2, 1) [L354] COND TRUE ! tmp___9 [L355] return (0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] c1 = check() [L578] COND TRUE ! arg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L580] __VERIFIER_error() VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=2, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=255, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 333 locations, 37 error locations. Result: UNSAFE, OverallTime: 467.2s, OverallIterations: 33, TraceHistogramMax: 3, AutomataDifference: 49.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8425 SDtfs, 13935 SDslu, 23289 SDs, 0 SdLazy, 14143 SolverSat, 1373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2703 GetRequests, 1663 SyntacticMatches, 96 SemanticMatches, 944 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51626 ImplicationChecksByTransitivity, 200.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=24, 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, 32 MinimizatonAttempts, 3928 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3501 NumberOfCodeBlocks, 3501 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3959 ConstructedInterpolants, 15 QuantifiedInterpolants, 2502415 SizeOfPredicates, 89 NumberOfNonLiveVariables, 3128 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 42 InterpolantComputations, 27 PerfectInterpolantSequences, 1979/2161 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 4044, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 73, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 161, TOOLS_POST_TIME[ms]: 172, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 161, TOOLS_QUANTIFIERELIM_TIME[ms]: 140, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 63, FLUID_QUERY_TIME[ms]: 8, FLUID_QUERIES: 253, FLUID_YES_ANSWERS: 4, DOMAIN_JOIN_APPLICATIONS: 17, DOMAIN_JOIN_TIME[ms]: 1333, DOMAIN_ALPHA_APPLICATIONS: 4, DOMAIN_ALPHA_TIME[ms]: 1771, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME[ms]: 349, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME[ms]: 22, DOMAIN_ISBOTTOM_APPLICATIONS: 73, DOMAIN_ISBOTTOM_TIME[ms]: 161, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 411, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 410, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 8, DAG_COMPRESSION_TIME[ms]: 181, DAG_COMPRESSION_PROCESSED_NODES: 12661, DAG_COMPRESSION_RETAINED_NODES: 206, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...